Summary: Graphs and Combinatorics 2, 95-100 (1986)
Decomposition of the Completer-Graphinto
Department of Mathematics, Tel Aviv University, Tel Aviv, Israel, and
Department ofMathematics, Massachusetts Institute ofTechnology,Cambridge, MA 02139, USA
Abstract. For n > r > 1,letf,(n) denote the minimum number q, such that it is possible to partition
all edges of the complete r-graph on n vertices into q complete r-partite r-graphs. Graham and
Pollak showed that fz(n) = n - 1.Here we observe that f3(n) = n - 2 and show that forevery fixed
r > 2, there are positive constants cx(r) and c2(r) such that q(r) < f,(n)" n-f'/2J < c2(r) for all n > r.
This solves a problem of Aharoni and Linial. The proof uses some simple ideas of linear algebra.
For n _> r _> 1, let £(n) denote the minimum number q, such that it is possible to
partition all edges of the complete r-uniform hypergraph on n vertices into q
pairwise edge-disjoint complete r-partite r-uniform hypergraphs.
Obviously, f~(n) = 1. Graham and Pollak (I-3, 4], see also [2, 5]) proved that
f2(n) = n - 1 for all n _> 2. Simple proofs for this result were found by Tverberg