Decomposition of the complete r-graph into complete r-partite r-graphs

DOI10.1007/BF01788083zbMath0616.05050OpenAlexW1522673698MaRDI QIDQ1821120

Noga Alon

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788083

zbMATH Keywords

complete hypergraphcomplete r-partite hypergraphdecomposition of hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (11)

A note on \(k\)-wise oddtown problems ⋮ Decomposing the complete \(r\)-graph ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ Query Complexity of Sampling and Small Geometric Partitions ⋮ Multicolored forests in bipartite decompositions of graphs ⋮ On the decomposition of random hypergraphs ⋮ The de Bruijn-Erdős theorem for hypergraphs ⋮ Multicovering hypergraphs ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs ⋮ On decompositions of complete hypergraphs

Cites Work

• Unnamed Item
• A new proof of a theorem of Graham and Pollak
• Distance matrix polynomials of trees
• On the decomposition ofkn into complete bipartite graphs
• On the Addressing Problem for Loop Switching

This page was built for publication: Decomposition of the complete r-graph into complete r-partite r-graphs