Lagrangians of hypergraphs. II: When colex is best
From MaRDI portal
Publication:2040206
DOI10.1007/s11856-021-2132-2zbMath1468.05196arXiv1907.09797OpenAlexW3158457148MaRDI QIDQ2040206
Natasha Morrison, Vytautas Gruslys, Shoham Letzter
Publication date: 12 July 2021
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.09797
Related Items (4)
Maximisers of the hypergraph Lagrangian outside the principal range ⋮ The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ An irrational Turán density via hypergraph Lagrangian densities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Hypergraphs do not jump
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- On the number of copies of one hypergraph in another
- An upper bound on the sum of squares of degrees in a hypergraph
- An upper bound on the sum of squares of degrees in a graph
- Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere
- A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
- The sum of the squares of degrees: sharp asymptotics
- Some results on Lagrangians of hypergraphs
- Lagrangians of Hypergraphs
- Sum of squares of degrees in a graph
- Graphs with maximal number of adjacent pairs of edges
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- A hypergraph Turán theorem via Lagrangians of intersecting families
This page was built for publication: Lagrangians of hypergraphs. II: When colex is best
