A new proof of a theorem of Graham and Pollak
From MaRDI portal
Publication:789411
DOI10.1016/0012-365X(84)90174-2zbMath0533.05049OpenAlexW1964610196MaRDI QIDQ789411
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90174-2
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (32)
Clique partitions of the cocktail party graph ⋮ Non-deterministic communication complexity with few witnesses ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposing the complete \(r\)-graph ⋮ Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ More on the Bipartite Decomposition of Random Graphs ⋮ A polynomial space proof of the Graham-Pollak theorem ⋮ Finding biclique partitions of co-chordal graphs ⋮ A critical probability for biclique partition of \(G_{n,p}\) ⋮ Exact values and improved bounds on \(k\)-neighborly families of boxes ⋮ A counterexample to the Alon-Saks-Seymour conjecture and related problems ⋮ Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ On tournament matrices ⋮ Multicolored forests in bipartite decompositions of graphs ⋮ On the decomposition of random hypergraphs ⋮ On biclique partitions of the complete graph ⋮ Decomposition of Random Graphs into Complete Bipartite Graphs ⋮ Multicovering hypergraphs ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ Eigenvalues and clique partitions of graphs ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ Decomposition of the complete r-graph into complete r-partite r-graphs ⋮ Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs ⋮ On decompositions of complete hypergraphs ⋮ Bipartite decomposition of random graphs ⋮ Decomposition of product graphs into complete bipartite subgraphs
Cites Work
This page was built for publication: A new proof of a theorem of Graham and Pollak
