Improved Bounds for the Graham-Pollak Problem for Hypergraphs

Electronic Journal Of Combinatorics

Imre Leader¹ 

关键词: Hypergraph;    Decomposition;    Graham-Pollak;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

For a fixed $r$, let $f_r(n)$ denote the minimum number of complete $r$-partite $r$-graphs needed to partition the complete $r$-graph on $n$ vertices. The Graham-Pollak theorem asserts that $f_2(n)=n-1$. An easy construction shows that $f_r(n) \leq (1+o(1

【 授权许可】

Others