On Universal Graphs for Trees and Tree-Like Graphs
Neel Kaul, Jaehoon Kim, Minseo Kim, David R. Wood

TL;DR
This paper improves the upper bound on the number of edges needed in a universal graph for all n-vertex trees, and generalizes the result to graphs of bounded treewidth, matching the lower bound.
Contribution
It provides the first improvement to Chung and Graham's bound in over four decades and extends the result to treewidth-k graphs with optimal edge bounds.
Findings
Constructed n-vertex graphs with fewer edges that contain all n-vertex trees.
Generalized bounds to treewidth-k graphs with tight asymptotic match.
Improved the known upper bound from 7/2 n log n to 14/5 n log n edges.
Abstract
Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an -vertex graph with edges that contains every -vertex tree as a subgraph. Frati, Hoffmann and T\'oth [Combin. Probab. Comput. 2023] discovered an error in the proof. By adding more edges to the error can be corrected, bringing the number of edges in to We make the first improvement to Chung and Graham's bound in over four decades by showing that there exists an -vertex graph with edges that contains every -vertex tree as a subgraph. Furthermore, we generalise this bound for treewidth- graphs by showing that there exists a graph with edges that contains every -vertex treewidth- graph as a subgraph. This is best possible in the sense that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Complexity and Algorithms in Graphs
