Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions

DOI10.1016/J.EJC.2018.05.001zbMath1393.05169OpenAlexW2807653645MaRDI QIDQ1663794

Tao Jiang, Biao Wu, Yue Jian Peng

Publication date: 24 August 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2018.05.001

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (13)

A note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ 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 ⋮ A 2-stable family of triple systems ⋮ Lagrangian densities of linear forests and Turán numbers of their extensions ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS ⋮ The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions ⋮ An irrational Turán density via hypergraph Lagrangian densities ⋮ A unified approach to hypergraph stability

Cites Work

• Unnamed Item
• 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
• On the maximum number of edges in a hypergraph with given matching number
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Asymptotic solution for a new class of forbidden r-graphs
• A new generalization of Mantel's theorem to \(k\)-graphs
• An exact Turán result for the generalized triangle
• Hypergraphs do not jump
• Turán numbers of extensions
• Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere
• A hypergraph extension of Turán's theorem
• Lagrangians of Hypergraphs
• On maximal paths and circuits of graphs
• 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 some sparse hypergraphs and Turán numbers of their extensions