Decomposing the complete \(r\)-graph

DOI10.1016/j.jcta.2017.08.008zbMath1373.05149arXiv1701.08335OpenAlexW2584968584MaRDI QIDQ1679321

Luka Milićević, Imre Leader, Ta Sheng Tan

Publication date: 9 November 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphdecomposition

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

A note on \(k\)-wise oddtown problems ⋮ Odd covers of graphs ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ On the decomposition of random hypergraphs ⋮ Partition problems in high dimensional boxes ⋮ Multicovering hypergraphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs

Cites Work

• Unnamed Item
• A new proof of a theorem of Graham and Pollak
• On decompositions of complete hypergraphs
• Decomposition of product graphs into complete bipartite subgraphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• On partitions of discrete boxes
• Variations on a theme of Graham and Pollak
• A counting proof of the Graham-Pollak theorem
• A polynomial space proof of the Graham-Pollak theorem
• On the decomposition ofkn into complete bipartite graphs
• On Extremal Set Partitions in Cartesian Product Spaces
• On Partitioning and Packing Products with Rectangles
• Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
• On the Addressing Problem for Loop Switching