Exact computation of the hypergraph Turán function for expanded complete 2-graphs

Authors:
Oleg Pikhurko
Affiliations:
Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK
Venue:
Journal of Combinatorial Theory Series B
Year:
2013

Citing 11
Cited 2

On the Turán number of triple systems

Journal of Combinatorial Theory Series A
The Turán density of triple systems is not principal

Journal of Combinatorial Theory Series A
Stability theorems for cancellative hypergraphs

Journal of Combinatorial Theory Series B
Regularity lemma for k-uniform hypergraphs

Random Structures & Algorithms
Triple Systems Not Containing a Fano Configuration

Combinatorics, Probability and Computing
Applications of the regularity lemma for uniform hypergraphs

Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs

Random Structures & Algorithms
The Turán Number Of The Fano Plane

Combinatorica
A hypergraph extension of Turán's theorem

Journal of Combinatorial Theory Series B
On A Hypergraph Turán Problem Of Frankl

Combinatorica
An exact Turán result for the generalized triangle

Combinatorica

Linear trees in uniform hypergraphs

European Journal of Combinatorics
Counting substructures II: Hypergraphs

Combinatorica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let lk=3. Let the k-graph H"l^(^k^) 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, J. Combin. Theory Ser. B 96 (2006) 122-134] 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.