On decompositions of complete hypergraphs

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:116

Article

Cioaba, Sebastian M.¹  Kuendgen, Andre²  Verstraete, Jacques³ 

[1] Univ Delaware, Dept Math Sci, Newark, DE 19716 USA

[2] Calif State Univ, Dept Math, San Marcos, CA 92096 USA

[3] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA

关键词: Hypergraph;    Decomposition;    Graham-Pollak;    Kneser graph;    Biclique;   

DOI  :  10.1016/j.jcta.2009.02.007

来源: Elsevier

【 摘 要 】

We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon. (C) 2009 Elsevier Inc. All rights reserved.

【 授权许可】

Free