2-factors in dense graphs

DOI10.1016/0012-365X(95)00242-OzbMath0851.05068OpenAlexW2018839087MaRDI QIDQ1917480

Noga Alon, Eldar Fischer

Publication date: 7 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00242-o

zbMATH Keywords

trianglebipartitedegreefactor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Blow-up lemma ⋮ Graphs containing every 2-factor ⋮ Hamiltonian cycles with all small even chords ⋮ Fan-type condition on disjoint cycles in a graph ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ 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 ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Cycle factors in dense graphs ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Embedding Graphs Having Ore-Degree at Most Five ⋮ A near packing of two graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• On circuits in graphs
• Almost \(H\)-factors in dense graphs
• The tail of the hypergeometric distribution
• On the maximum number of independent cycles in a graph
• \(H\)-factors in dense graphs
• Pancyclic graphs. I
• The strong chromatic number of a graph
• On the maximal number of independent circuits in a graph

This page was built for publication: 2-factors in dense graphs