Back to Search
Start Over
Decomposing the complete r-graph.
- Source :
-
Journal of Combinatorial Theory - Series A . Feb2018, Vol. 154, p21-31. 11p. - Publication Year :
- 2018
-
Abstract
- Let f r ( n ) be the minimum number of complete r -partite r -graphs needed to partition the edge set of the complete r -uniform hypergraph on n vertices. Graham and Pollak showed that f 2 ( n ) = n − 1 . An easy construction shows that f r ( n ) ≤ ( 1 − o ( 1 ) ) ( n ⌊ r / 2 ⌋ ) and it has been unknown if this upper bound is asymptotically sharp. In this paper we show that f r ( n ) ≤ ( 14 15 + o ( 1 ) ) ( n r / 2 ) for each even r ≥ 4 . [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00973165
- Volume :
- 154
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series A
- Publication Type :
- Academic Journal
- Accession number :
- 125983046
- Full Text :
- https://doi.org/10.1016/j.jcta.2017.08.008