arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.11840math.CO
收藏

改进的树 universal 图

Improved Universal Graphs for Trees

LMU Munich(慕尼黑大学);Munich, Germany(德国慕尼黑)

Julian Becker, Konstantinos Panagiotou, Matija Pasch

AI总结:

本文改进了树 universal 图的上界,提出了一种将树分为三部分的策略,并扩展到具有有限树宽的图。

摘要:

图$G$若能包含所有类$\mathcal{C}$中的图作为子图,则称其为$\mathcal{C}$的universal图。1978年,Chung和Graham提出了一个问题:对于具有$n$个顶点的图,最小的边数$s(n)$使得该图能包含所有具有$n$个顶点的树作为子图。目前的最佳界表明,$n\ln n -O(n)\leq s(n) \leq C n\ln n +O(n)$,其中$C = \frac{14}{5\ln 2} \approx 4.04$。我们改进了上界为$c n\ln n + O(n)$,其中$c = \frac{19}{6\ln 3} \approx 2.88$。在证明过程中,我们发展了一种策略,大致上是基于将树分成三部分,从而能够将它们嵌入一种源自三叉树的结构中。我们的方法也适用于具有树宽上界限制的图。设$s_w(n)$为具有$n$个顶点的图的最小边数,该图能包含所有树宽为$w$的图作为子图。通过对我们为树设计的universal结构进行放大,我们得出$nw \ln(n/w) -O(nw) \leq s_w(n) \leq \frac{19}{6\ln3} n (w+1) \ln(n/w) + O(nw)$。

英文摘要:

A graph $G$ is universal for a class of graphs $\mathcal{C}$, if, up to isomorphism, $G$ contains every graph in $\mathcal{C}$ as a subgraph. In 1978, Chung and Graham asked for the minimal number $s(n)$ of edges in a graph with $n$ vertices that is universal for all trees with $n$ vertices. The currently best bounds assert that $n\ln n-O(n)\le s(n) \le C n\ln n+O(n)$, where $C = \frac{14}{5\ln 2} \approx 4.04$. We improve the upper bound to $c n\ln n + O(n)$, where $c = \frac{19}{6\ln 3} \approx 2.88$. In the proof we develop a strategy that, broadly speaking, is based on separating trees into three parts, thus enabling us to embed them in a structure that originates from ternary trees. Our method also applies to graphs with a bound on their treewidth. Let $s_w(n)$ be the minimum number of edges in a $n$-vertex graph that is universal for graphs with treewidth $w$. By performing a blow-up to our universal structure for trees we establish that $nw \ln(n/w) -O(nw) \leq s_w(n) \leq \frac{19}{6\ln3} n (w+1) \ln(n/w) + O(nw)$.

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

↑