Decomposition of the complete r-graph into complete r-partite r-graphs
From MaRDI portal
Publication:1821120
DOI10.1007/BF01788083zbMath0616.05050MaRDI QIDQ1821120
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788083
05C65: Hypergraphs
Related Items
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs, Query Complexity of Sampling and Small Geometric Partitions, On the decomposition of random hypergraphs, The de Bruijn-Erdős theorem for hypergraphs, On decompositions of complete hypergraphs, Multicolored forests in bipartite decompositions of graphs, Decomposing the complete \(r\)-graph, Improved bounds for the Graham-Pollak problem for hypergraphs, Multicovering hypergraphs, A note on \(k\)-wise oddtown problems, Bounds for the Graham-Pollak theorem for hypergraphs
Cites Work