Note: On decompositions of complete hypergraphs

Authors:
Sebastian M. Cioabă;André Kündgen;Jacques Verstraëte
Affiliations:
Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA;Department of Mathematics, California State University, San Marcos, CA 92096-0001, USA;Department of Mathematics, University of California at San Diego, La Jolla, CA 92093-0112, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2009

Citing 5
Cited 0

Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability

Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Tensor rank is NP-complete

Journal of Algorithms
Inertia and biclique decompositions of joins of graphs

Journal of Combinatorial Theory Series B
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications

SIAM Journal on Computing
Note: A polynomial space proof of the Graham--Pollak theorem

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.