Variations on a theme of Graham and Pollak
From MaRDI portal
Recommendations
Cited in
(17)- Decomposing the complete \(r\)-graph
- Improved bounds for the Graham-Pollak problem for hypergraphs
- Addressing graph products and distance-regular graphs
- Multicovering hypergraphs
- Regarding two conjectures on clique and biclique partitions
- Bounds for the Graham-Pollak theorem for hypergraphs
- More on the bipartite decomposition of random graphs
- Continuing Variations on a System of Gentzen
- Clique versus independent set
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Bipartite edge partitions and the former Alon-Saks-Seymour conjecture
- scientific article; zbMATH DE number 1421050 (Why is no real title available?)
- New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
- Finding biclique partitions of co-chordal graphs
- On the decomposition of random hypergraphs
- On the biclique cover of the complete graph
This page was built for publication: Variations on a theme of Graham and Pollak
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939586)