On the edge-colouring problem for unions of complete uniform hypergraphs

DOI10.1016/0012-365X(81)90003-0zbMath0471.05049MaRDI QIDQ1157347

Andries E. Brouwer, Robert Tijdeman

Publication date: 1981

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

zbMATH Keywords

Baranyai's theorem1-factorizationcomplete uniform hypergraph

Mathematics Subject Classification ID

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

Related Items

Detachments of Hypergraphs I: The Berge–Johnson Problem, Disjoint Spread Systems and Fault Location

Cites Work

• An Inequality on Binomial Coefficients
• On the Edge-Coloring Property for the Closure of the Complete Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item