DC Field | Value | Language |
---|---|---|
dc.contributor.author | Leader, Imre | en |
dc.contributor.author | Milićević, Luka | en |
dc.contributor.author | Tan, Ta Sheng | en |
dc.date.accessioned | 2020-05-01T20:12:38Z | - |
dc.date.available | 2020-05-01T20:12:38Z | - |
dc.date.issued | 2018-02-01 | en |
dc.identifier.issn | 0097-3165 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1043 | - |
dc.description.abstract | Let fr(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 f2(n)=n−1. An easy construction shows that fr(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 fr(n)≤([formula presented]+o(1))(nr/2) for each even r≥4. | en |
dc.publisher | Elsevier | - |
dc.relation | Ministry of Higher Education of Malaysia, FRGS grant FP048-2014B | - |
dc.relation.ispartof | Journal of Combinatorial Theory. Series A | en |
dc.subject | Decomposition | Graham–Pollak | Hypergraph | en |
dc.title | Decomposing the complete r-graph | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.jcta.2017.08.008 | en |
dc.identifier.scopus | 2-s2.0-85029491778 | en |
dc.relation.firstpage | 21 | en |
dc.relation.lastpage | 31 | en |
dc.relation.volume | 154 | en |
dc.description.rank | M21 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0002-1427-7241 | - |
SCOPUSTM
Citations
7
checked on Sep 15, 2024
Page view(s)
6
checked on Sep 16, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.