We show that for every n∈Nn∈N and logn≤d≤nlogn≤d≤n, if a graph GG has N=Θ(dn)N=Θ(dn) vertices and minimum degree (1+o(1))N2(1+o(1))2N, then it contains a spanning subdivision of every nn-vertex dd-regular graph.
生成讲解博客的中文版本
生成AI智能校验的中文版本