Proof of a Packing Conjecture of Bollobás
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Source record
Source: Crossref
Published: Sep 1, 1995
DOI: 10.1017/s0963548300001620
Open original source ↗Source abstract
Béla Bollobás [1] conjectured the following. For any positive integer Δ and real 0 < c < ½ there exists an n 0 with the following properties. If n ≥ n 0 , T is a tree of order n and maximum degree Δ, and G is a graph of order n and maximum degree not exceeding cn , then there is a packing of T and G . Here we prove this conjecture. Auxiliary Theorem 2.1 is of independent interest.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.