We show that for every $n\in\mathbb N$ and $\log n\le d\le n$, if a graph $G$ has $N=Θ(dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$, then it contains a spanning subdivision of every $n$-vertex $d$-regular graph.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。