An Ore-type Theorem for Perfect Packings in Graphs

DOI10.1137/080731256zbMath1207.05059arXiv0807.4907OpenAlexW2056485055MaRDI QIDQ3583306

Deryk Osthus, Andrew Treglown, Daniela Kühn

Publication date: 27 August 2010

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

Full work available at URL: https://arxiv.org/abs/0807.4907

zbMATH Keywords

regularity Lemma\(H\)-packings\(H\)-factorsOre-type conditions

Mathematics Subject Classification ID

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

Related Items (15)

Sharp minimum degree conditions for the existence of disjoint theta graphs ⋮ Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Graph Tilings in Incompatibility Systems ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Degree sum and graph linkage with prescribed path lengths ⋮ Note on Enomoto and Ota's conjecture for short paths in large graphs ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Enomoto and Ota's conjecture holds for large graphs ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle ⋮ A geometric theory for hypergraph matching ⋮ A degree sequence Hajnal-Szemerédi theorem

This page was built for publication: An Ore-type Theorem for Perfect Packings in Graphs