Factorizations of complete multipartite hypergraphs

DOI10.1016/J.DISC.2016.08.007MaRDI QIDQ2374157zbMATH OpenOpenAlexWikidataFDO

Authors M. A. Bahmanian

Publication date 14 December 2016

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

amalgamationsBaranyai's theoremdecompositionsdetachmentsfactorizationsmultipartite hypergraphs

Mathematics Subject Classification ID

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

Abstract: In a mathematics workshop with $mn$ mathematicians from $n$ different areas, each area consisting of $m$ mathematicians, we want to create a collaboration network. For this purpose, we would like to schedule daily meetings between groups of size three, so that (i) two people of the same area meet one person of another area, (ii) each person has exactly $r$ meeting(s) each day, and (iii) each pair of people of the same area have exactly $lambda$ meeting(s) with each person of another area by the end of the workshop. Using hypergraph amalgamation-detachment, we prove a more general theorem. In particular we show that above meetings can be scheduled if: $3|rm$, $2|rnm$ and $$. This result can be viewed as an analogue of Baranyai's theorem on factorizations of complete multipartite hypergraphs.

Recommendations

• Connected Baranyai's theorem
• The equipartite Oberwolfach problem with uniform tables
• Detachments of hypergraphs I: The Berge-Johnson problem
• scientific article; zbMATH DE number 1394637
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences

Cites work

• Amalgamations of almost regular edge-colourings of simple graphs
• Amalgamations of factorizations of complete graphs
• Connected Baranyai's theorem
• Decompositions of Complete Graphs
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
• Detachments of hypergraphs I: The Berge-Johnson problem
• Embedding factorizations for 3-uniform hypergraphs
• Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• Multiply balanced edge colorings of multigraphs
• The edge-coloring of complete hypergraphs. I

Cited in

(6)

• \(F\)-factors in hypergraphs via absorption
• Symmetric factorizations of the complete uniform hypergraph
• scientific article; zbMATH DE number 5823698 (Why is no real title available?)
• scientific article; zbMATH DE number 4012665 (Why is no real title available?)
• Factorizations of and by powers of complete graphs
• Indecomposable factorizations of multigraphs

This page was built for publication: Factorizations of complete multipartite hypergraphs

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