Improved Universal Graphs for Trees
Julian Becker, Konstantinos Panagiotou, Matija Pasch

TL;DR
This paper improves bounds on the minimal number of edges in universal graphs for trees and graphs with bounded treewidth, using a novel embedding strategy based on separating trees into three parts.
Contribution
It introduces a new method for constructing universal graphs for trees and bounded treewidth graphs, reducing the upper bound on the number of edges needed.
Findings
Improved upper bound for universal graphs for trees to approximately 2.88 n log n.
Extended the method to graphs with bounded treewidth, establishing bounds involving w and n.
Developed a tree separation strategy based on ternary tree structures.
Abstract
A graph is universal for a class of graphs , if, up to isomorphism, contains every graph in as a subgraph. In 1978, Chung and Graham asked for the minimal number of edges in a graph with vertices that is universal for all trees with vertices. The currently best bounds assert that , where . We improve the upper bound to , where . 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 be the minimum number of edges in a -vertex graph that is universal for graphs with treewidth . By performing a…
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 · Graph theory and applications
