The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
From MaRDI portal
Publication:2671549
DOI10.1007/s10114-022-0388-zzbMath1490.05128OpenAlexW4282048152MaRDI QIDQ2671549
Publication date: 3 June 2022
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-022-0388-z
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (3)
A note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian ⋮ Lagrangian-perfect hypergraphs ⋮ An irrational Turán density via hypergraph Lagrangian densities
Cites Work
- Unnamed Item
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Turán number of generalized triangles
- A hypergraph Turán theorem via Lagrangians of intersecting families
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Asymptotic solution for a new class of forbidden r-graphs
- Hypergraphs do not jump
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Turán numbers of extensions
- Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere
- Lagrangians of hypergraphs. II: When colex is best
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
- Maximisers of the hypergraph Lagrangian outside the principal range
- A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians
- Lagrangian densities of enlargements of matchings in hypergraphs
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- Lagrangians of Hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- 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
- Lagrangian densities of linear forests and Turán numbers of their extensions
This page was built for publication: The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
