A hypergraph Turán theorem via lagrangians of intersecting families

Dan Hefetz, Peter Keevash

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

Let K3,33 be the 3-graph with 15 vertices {x i, y i : 1 ≤ i ≤ 3} and {z i j : 1 ≤ i, j ≤ 3}, and 11 edges {x1, x2, x3}, {y1, y2, y3} and {{x i, y j, z i j} : 1 ≤ i, j ≤ 3}. We show that for large n, the unique largest K3,33-free 3-graph on n vertices is a balanced blow-up of the complete 3-graph on 5 vertices. Our proof uses the stability method and a result on lagrangians of intersecting families that has independent interest.

Original languageEnglish
Pages (from-to)2020-2038
Number of pages19
JournalJournal of Combinatorial Theory. Series A
Volume120
Issue number8
DOIs
StatePublished - Nov 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'A hypergraph Turán theorem via lagrangians of intersecting families'. Together they form a unique fingerprint.

Cite this