Packing spanning graphs from separable families
Asaf Ferber, Choongbum Lee, Frank Mousset

TL;DR
This paper proves that large collections of graphs from a separable family with bounded maximum degree can be packed into a complete graph, improving previous results and implying approximate solutions to classical graph packing problems.
Contribution
It establishes a general packing theorem for separable graph families with bounded degree, extending known results and providing new approximate solutions to longstanding conjectures.
Findings
Graphs from separable families with bounded degree pack into complete graphs under certain conditions.
Improves bounds for packing trees and general separable graphs.
Implicates approximate solutions to the Oberwolfach problem and Tree Packing Conjecture.
Abstract
Let be a separable family of graphs. Then for all positive constants and and for every sufficiently large integer , every sequence of graphs of order and maximum degree at most such that packs into . This improves results of B\"ottcher, Hladk\'y, Piguet, and Taraz when is the class of trees and of Messuti, R\"odl, and Schacht in the case of a general separable family. The result also implies approximate versions of the Oberwolfach problem and of the Tree Packing Conjecture of Gy\'arf\'as (1976) for the case that all trees have maximum degree at most . The proof uses the local resilience of random graphs and a special multi-stage packing procedure.
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.
