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

DOI10.1016/0012-365X(81)90003-0MaRDI QIDQ1157347zbMATH OpenFDO

Authors Andries E. Brouwer, R. Tijdeman

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(81)90003-0

zbMATH Keywords

1-factorizationBaranyai's theoremcomplete uniform hypergraph

Mathematics Subject Classification ID

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

Cites work

• An Inequality on Binomial Coefficients
• scientific article; zbMATH DE number 3683587 (Why is no real title available?)
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• scientific article; zbMATH DE number 3570501 (Why is no real title available?)
• On the Edge-Coloring Property for the Closure of the Complete Hypergraphs

Cited in

(2)

• Disjoint spread systems and fault location
• Detachments of hypergraphs I: The Berge-Johnson problem

This page was built for publication: On the edge-colouring problem for unions of complete uniform hypergraphs

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