Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs
Combinatorics
2007-05-23 v1
Abstract
Let l>k>2. Let the k-graph H^k_l be obtained from the complete 2-graph K_l^2 by enlarging each edge with a new set of k-2 vertices. Mubayi ["A hypergraph extension of Turan's theorem", to appear in J. Combin. Th. (B)] computed asymptotically the Turan function ex(n,H_l^k). Here we determine the exact value of ex(n,H_l^k) for all sufficiently large n, settling a conjecture of Mubayi.
Cite
@article{arxiv.math/0510227,
title = {Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs},
author = {Oleg Pikhurko},
journal= {arXiv preprint arXiv:math/0510227},
year = {2007}
}
Comments
Accepted by JCTB; publication suspended because of a disagreement over the copyright, see http://www.math.cmu.edu/~pikhurko/Copyright.html