Variations on a theme of Graham and Pollak
From MaRDI portal
Publication:1939586
DOI10.1016/j.disc.2012.12.001zbMath1259.05137OpenAlexW1977325698MaRDI QIDQ1939586
Michael Tait, Sebastian M. Cioabă
Publication date: 4 March 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.12.001
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (12)
Regarding two conjectures on clique and biclique partitions ⋮ Decomposing the complete \(r\)-graph ⋮ New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) ⋮ Clique versus independent set ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ On the biclique cover of the complete graph ⋮ More on the Bipartite Decomposition of Random Graphs ⋮ Finding biclique partitions of co-chordal graphs ⋮ On the decomposition of random hypergraphs ⋮ Addressing graph products and distance-regular graphs ⋮ Multicovering hypergraphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs
This page was built for publication: Variations on a theme of Graham and Pollak