A hypergraph Turán theorem via Lagrangians of intersecting families

DOI10.1007/978-88-7642-475-5_5zbMath1291.05098arXiv1307.8423OpenAlexW4238007120MaRDI QIDQ5419938

Dan Hefetz, Peter Keevash

Publication date: 11 June 2014

Published in: The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.8423

zbMATH Keywords

stability method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (3)

Maximisers of the hypergraph Lagrangian outside the principal range ⋮ Lagrangians of hypergraphs. II: When colex is best ⋮ Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false

Cites Work

• Unnamed Item
• Extremal problems whose solutions are the blowups of the small Witt- designs
• An exact Turán result for the generalized triangle
• Lagrangians of Hypergraphs

This page was built for publication: A hypergraph Turán theorem via Lagrangians of intersecting families