Every H-decomposition of K_n has a nearly resolvable alternative

DOI10.1006/EUJC.2000.0400zbMATH Open0966.05058OpenAlexW2033389393MaRDI QIDQ1587903FDOQ1587903

Authors: 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

Recommendations

• Minimum \(H\)-decompositions of graphs
• Orthogonal \(H\)-decompositions.
• Almost resolvable P_k‐decompositions of complete graphs
• An improved error term for minimum \(H\)-decompositions of graphs
• On resolvable tree-decompositions of complete graphs

zbMATH Keywords

decompositioncomplete graphcolour class

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic behavior of the chromatic index for hypergraphs
• Title not available (Why is that?)
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Asymptotically good list-colorings

Cited In (6)

• Packing spanning graphs from separable families
• Packing minor-closed families of graphs into complete graphs
• Packing minor closed families of graphs
• A blow-up lemma for approximate decompositions
• On zero-sum spanning trees and zero-sum connectivity
• Orthogonal \(H\)-decompositions.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587903)