Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
From MaRDI portal
Publication:1878591
DOI10.1007/s00493-003-0013-4zbMath1046.05040OpenAlexW2001660893WikidataQ123183552 ScholiaQ123183552MaRDI QIDQ1878591
A. Shokoufander, Endre Szemerédi, Béla Csaba
Publication date: 7 September 2004
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-003-0013-4
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (16)
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Graphs containing every 2-factor ⋮ Packing two graphs of even girth 10 ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A Dirac-Type Result on Hamilton Cycles in Oriented Graphs ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Packing \(d\)-degenerate graphs ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ On a graph packing conjecture by Bollobás, Eldridge and Catlin ⋮ On the Bollobás–Eldridge Conjecture for Bipartite Graphs ⋮ On the relation of separability, bandwidth and embedding ⋮ Packing Graphs of Bounded Codegree ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Embedding Graphs Having Ore-Degree at Most Five
This page was built for publication: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
