Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative

DOI10.1006/EUJC.2000.0400zbMath0966.05058OpenAlexW2033389393MaRDI QIDQ1587903

Noga Alon, Raphael Yuster

Publication date: 12 August 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2000.0400

zbMATH Keywords

decompositioncomplete graphcolour class

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Packing minor-closed families of graphs into complete graphs ⋮ Packing spanning graphs from separable families ⋮ Packing minor closed families of graphs ⋮ A blow-up lemma for approximate decompositions ⋮ On zero-sum spanning trees and zero-sum connectivity

Cites Work

• Asymptotic behavior of the chromatic index for hypergraphs
• Asymptotically good list-colorings
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative