A counting proof of the Graham-Pollak theorem

DOI10.1016/j.disc.2012.12.017zbMath1260.05099arXiv1007.1553OpenAlexW2053898220MaRDI QIDQ1942667

Sundar Vishwanathan

Publication date: 19 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Graham-Pollak theoremcounting proof

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

A combinatorial proof of Fisher's inequality ⋮ Decomposing the complete \(r\)-graph ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ Finding biclique partitions of co-chordal graphs ⋮ Exact values and improved bounds on \(k\)-neighborly families of boxes ⋮ On the decomposition of random hypergraphs ⋮ The de Bruijn-Erdős theorem for hypergraphs ⋮ Decomposition of Random Graphs into Complete Bipartite Graphs ⋮ Multicovering hypergraphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs

This page was built for publication: A counting proof of the Graham-Pollak theorem