On perfect packings in dense graphs

zbMath1266.05115arXiv1110.3490MaRDI QIDQ1953444

Andrew Treglown, József Balogh, Alexandr V. Kostochka

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

equitable colouringssubgraph packings

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) Density (toughness, etc.) (05C42)

Related Items (9)

On a degree sequence analogue of Pósa's conjecture ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ A degree sequence version of the Kühn-Osthus tiling theorem ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ A Degree Sequence Komlós Theorem ⋮ Downhill domination problem in graphs ⋮ A degree sequence Hajnal-Szemerédi theorem

This page was built for publication: On perfect packings in dense graphs