Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
From MaRDI portal
Publication:2045366
Abstract: For a fixed positive integer and an -uniform hypergraph , the Tur'an number is the maximum number of edges in an -free -uniform hypergraph on vertices, and the Lagrangian density of is defined as , where is the Lagrangian of . For an -uniform hypergraph on vertices, it is clear that . We say that an -uniform hypergraph on vertices is perfect if . Let be the linear -uniform path of length , that is, , and if . We show that and are perfect, this supports a conjecture in cite{yanpeng} proposing that all -uniform linear hypergraphs are perfect. Applying the results on Lagrangian densities, we determine the Tur'an numbers of their extensions.
Recommendations
- The Lagrangian density of the disjoint union of a \(3\)-uniform tight path and a matching and the Turán number of its extension
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Lagrangian densities of enlargements of matchings in hypergraphs
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
Cites work
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians
- A hypergraph Turán theorem via Lagrangians of intersecting families
- An exact Turán result for the generalized triangle
- Asymptotic solution for a new class of forbidden r-graphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- Hypergraphs do not jump
- Lagrangian densities of enlargements of matchings in hypergraphs
- Lagrangian densities of linear forests and Turán numbers of their extensions
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- On the structure of linear graphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
- Turán number of generalized triangles
- Turán numbers of extensions
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
Cited in
(10)- Lagrangian densities of linear forests and Turán numbers of their extensions
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
- An irrational Turán density via hypergraph Lagrangian densities
- Lagrangian densities of enlargements of matchings in hypergraphs
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- The Lagrangian density of the disjoint union of a \(3\)-uniform tight path and a matching and the Turán number of its extension
- The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
- Lagrangian-perfect hypergraphs
This page was built for publication: Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045366)