Factorizations of complete multipartite hypergraphs
From MaRDI portal
Publication:2374157
DOI10.1016/j.disc.2016.08.007zbMath1351.05160arXiv2102.02869OpenAlexW2512589977WikidataQ114190718 ScholiaQ114190718MaRDI QIDQ2374157
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
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
- Connected Baranyai's theorem
- Hamiltonian decompositions of complete graphs
- Amalgamations of factorizations of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- Amalgamations of almost regular edge-colourings of simple graphs
- The edge-coloring of complete hypergraphs. I
- Multiply balanced edge colorings of multigraphs
- Detachments of Hypergraphs I: The Berge–Johnson Problem
- Decompositions of Complete Graphs
- Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
- Embedding Factorizations for 3-Uniform Hypergraphs