On decompositions of complete hypergraphs

DOI10.1016/j.jcta.2009.02.007zbMath1211.05089OpenAlexW1985908622MaRDI QIDQ1040837

André Kündgen, Sebastian M. Cioabă, Jacques Verstraete

Publication date: 26 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.02.007

zbMATH Keywords

hypergraphdecompositionbicliqueGraham-Pollakkneser graph

Mathematics Subject Classification ID

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

Related Items (11)

A note on \(k\)-wise oddtown problems ⋮ Decomposing the complete \(r\)-graph ⋮ Odd covers of graphs ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ Query Complexity of Sampling and Small Geometric Partitions ⋮ On the decomposition of random hypergraphs ⋮ The de Bruijn-Erdős theorem for hypergraphs ⋮ Multicovering hypergraphs ⋮ Emergence and dynamics of short food supply chains ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs

Cites Work

• A new proof of a theorem of Graham and Pollak
• Inertia and biclique decompositions of joins of graphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• A polynomial space proof of the Graham-Pollak theorem
• Tensor rank is NP-complete
• On the decomposition ofkn into complete bipartite graphs
• Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
• Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On decompositions of complete hypergraphs