Improved bounds for the graham-pollak problem for hypergraphs
For a fixed r, let fr(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 f2(n) = n – 1. An easy construction shows that [formula presented], and we write cr for the least number such that [formul...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 出版: |
Australian National University
2018
|
| 主题: | |
| 在线阅读: | http://eprints.um.edu.my/21540/ https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p4/pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|