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

关于树和树宽 $k$ 图的泛图

On universal graphs for trees and treewidth $k$ graphs

Neel Kaul, David R. Wood

AI总结:

本文纠正了关于树泛图边数上界的错误证明,给出改进的完全自包含证明,并推广到树宽 $k$ 图,得到匹配的上下界。

摘要:

设 $s(n)$ 为包含每个 $n$ 顶点树作为子图的图的最小边数。Chung 和 Graham [J. London Math. Soc. 1983] 声称证明了 $s(n)\leqslant O(n\log n)$。我们指出他们证明中的一个错误。先前已知的最佳上界是 Chung、Graham 和 Pippenger [Proc. Hungarian Coll. on Combinatorics 1976] 给出的 $s(n)\leqslant O(n(\log n)(\log\log n)^{2})$,但其证明缺少许多关键细节。我们给出了新的改进上界 $s(n)\leqslant O(n(\log n)(\log\log n))$ 的完全自包含证明。已知最佳下界为 $s(n)\geqslant Ω(n\log n)$。我们将这些结果推广到树宽为 $k$ 的图。对于整数 $k\geqslant 1$,设 $s_k(n)$ 为包含每个具有树宽 $k$ 的 $n$ 顶点图作为子图的最小边数。因此 $s(n)=s_1(n)$。我们证明 $Ω(k n\log n) \leqslant s_k(n) \leqslant O(kn(\log n)(\log\log n))$。

英文摘要:

Let $s(n)$ be the minimum number of edges in a graph that contains every $n$-vertex tree as a subgraph. Chung and Graham [J. London Math. Soc. 1983] claim to prove that $s(n)\leqslant O(n\log n)$. We point out a mistake in their proof. The previously best known upper bound is $s(n)\leqslant O(n(\log n)(\log\log n)^{2})$ by Chung, Graham and Pippenger [Proc. Hungarian Coll. on Combinatorics 1976], the proof of which is missing many crucial details. We give a fully self-contained proof of the new and improved upper bound $s(n)\leqslant O(n(\log n)(\log\log n))$. The best known lower bound is $s(n)\geqslant Ω(n\log n)$. We generalise these results for graphs of treewidth $k$. For an integer $k\geqslant 1$, let $s_k(n)$ be the minimum number of edges in a graph that contains every $n$-vertex graph with treewidth $k$ as a subgraph. So $s(n)=s_1(n)$. We show that $Ω(k n\log n) \leqslant s_k(n) \leqslant O(kn(\log n)(\log\log n))$.

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

↑