2010/06/03 by Keith Mellinger, Mellinger, Keith, Dhruv Mubayi +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1006.0745
This paper has been withdrawn by the authors due to the fact that Theorem 1 was proved earlier.
arxiv created 2010/06/28 · arxiv updated 2010/06/29
Fix integers n ≥ r ≥ 2. A clique partition of [n] \choose r is a collection of proper subsets A1, A2, ..., At ⊂ [n] such that \bigcupiAi \choose r is a partition of [n] \choose r. Clique partitions are related to design theory, coding theory, projective geometry, and extremal combinatorics. Let \cp(n,r) denote the minimum size of a clique partition of [n] \choose r. A classical theorem of de Bruijn and Erd\H os states that \cp(n, 2) = n and also determines the extremal configurations. In this paper we study \cp(n,r), and show in general that for each fixed r ≥ 3, \cp(n,r) ≥ (1 + o(1))nr/2 asn → ∞. We conjecture \cp(n,r) = (1 + o(1))nr/2, and prove this conjecture in a very strong sense for r = 3 by giving a characterization of optimal clique partitions of [n] \choose 3 for infinitely many n. Precisely, when n = q2 + 1 and q is a prime power, we show \cp(n,3) = n√(n-1) and characterize those clique partitions achieving equality. We also give an absolute lower bound \cp(n,r) ≥ n \choose r/q + r - 1 \choose r when n = q2 + q + r - 1, and for each r characterize the finitely many configurations achieving equality with the lower bound. Finally we note the connection of \cp(n,r) to extremal graph theory, and determine some new asymptotically sharp bounds for the Zarankiewicz problem.