Bounds for the Graham-Pollak Theorem for Hypergraphs

Anand Babu, Sundar Vishwanathan

Let $f_r(n)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-P…