Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere

DOI10.1016/j.endm.2017.07.072zbMath1378.05150arXiv1703.04273OpenAlexW2596400672WikidataQ122873772 ScholiaQ122873772MaRDI QIDQ1690055

Mykhaylo Tyomkyn

Publication date: 18 January 2018

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsLagrangianextremal problemsmultivariate optimizationFrankl-Füredi conjecturecolexicographic order

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (13)

An Irrational Lagrangian Density of a Single Hypergraph ⋮ Unnamed Item ⋮ Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions ⋮ Maximisers of the hypergraph Lagrangian outside the principal range ⋮ The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex ⋮ Lagrangian-perfect hypergraphs ⋮ \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles ⋮ Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere ⋮ Lagrangian densities of linear forests and Turán numbers of their extensions ⋮ Lagrangians of hypergraphs. II: When colex is best ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false ⋮ An irrational Turán density via hypergraph Lagrangian densities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• A hypergraph Turán theorem via Lagrangians of intersecting families
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Hypergraphs do not jump
• Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere