On universal graphs for trees and treewidth $k$ graphs

TL;DR

This paper refines bounds on the minimum edges needed in graphs to contain all n-vertex trees and graphs of treewidth k, correcting previous proofs and providing new, tighter bounds.

Contribution

It corrects a flawed proof, provides a self-contained proof for an improved upper bound, and generalizes results to graphs with bounded treewidth.

Findings

Established a new upper bound for s(n): O(n(log n)(log log n)).

Confirmed the lower bound s(n) ≥ Ω(n log n).

Extended bounds to graphs with treewidth k, showing Ω(k n log n) ≤ s_k(n) ≤ O(k n(log n)(log log n)).

Abstract

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 \Omega(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 $\Omega(k n\log n) \leqslant s_k(n) \leqslant O(kn(\log n)(\log\log n))$.