Lagrangian densities of linear forests and Turán numbers of their extensions
From MaRDI portal
Publication:6185559
DOI10.1002/jcd.21687OpenAlexW2989776024MaRDI QIDQ6185559
Yue Jian Peng, Biao Wu, Sinan Hu
Publication date: 29 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21687
Related Items (5)
The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ Lagrangian-perfect hypergraphs ⋮ Connection between continuous optimization and Turán densities of non-uniform hypergraphs ⋮ Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
Cites Work
- Unnamed Item
- 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
- An exact Turán result for the generalized triangle
- 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
- 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
- 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
- A Motzkin-Straus type result for 3-uniform hypergraphs
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- The Lagrangian density of the disjoint union of a \(3\)-uniform tight path and a matching and the Turán number of its extension
- Lagrangians of Hypergraphs
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- 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
This page was built for publication: Lagrangian densities of linear forests and Turán numbers of their extensions
