Dense 3-uniform hypergraphs containing a large clique

DOI10.1007/s11425-016-0197-yzbMath1383.05223arXiv1701.06139OpenAlexW2581979406MaRDI QIDQ1741994

Biao Wu, Yue Jian Peng

Publication date: 11 April 2018

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06139

zbMATH Keywords

dense hypergraphsTurán densityLagrangian of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Density (toughness, etc.) (05C42)

Related Items (1)

Connection between continuous optimization and Turán densities of non-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Turán numbers of extensions
• A Motzkin-Straus type result for 3-uniform hypergraphs
• Lagrangians 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: Dense 3-uniform hypergraphs containing a large clique