Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three

Béla Csaba, Ali Shokoufandeh, Endre Szemerédi

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

Let G1 and G2 be simple graphs on n vertices. If there are edge-disjoint copies of G1 and G2 in Kn, then we say there is a packing of G1 and G2. A conjecture of Bollobás and Eldridge asserts that if (Δ(G1) + 1)(Δ(G2) +1) ≤ n+1 then there is a packing of G1 and G2. We prove this conjecture when Δ(G1)=3, for sufficiently large n.

Original languageEnglish
Pages (from-to)35-72
Number of pages38
JournalCombinatorica
Volume23
Issue number1
DOIs
Publication statusPublished - Aug 1 2003

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three'. Together they form a unique fingerprint.

  • Cite this