arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.04712math.CO
收藏

高次图的星因子

Star-factors in graphs of high degree

Rajko Nenadov

摘要:

证明了最小度$d$足够大的图都包含一个生成森林,其中每个分支都是一个大小至少为$\sqrt{d} - \tilde O(d^{1/4})$的星。这改进了Alon和Wormald的结果,并且对于低阶项是最优的。

英文摘要:

We prove that every graph with sufficiently large minimum degree $d$ contains a spanning forest in which every component is a star of size at least $\sqrt{d} - \tilde O(d^{1/4})$. This improves the result of Alon and Wormald and is optimal up to the lower order term.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑