On graph-Lagrangians and clique numbers of 3-uniform hypergraphs

DOI10.1007/s10114-016-5472-9zbMath1346.05205OpenAlexW2473979496MaRDI QIDQ326974

Yan Ping Sun, Biao Wu, Yue Jian Peng

Publication date: 13 October 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-016-5472-9

zbMATH Keywords

Lagrangians of hypergraphsextremal problems in hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• A hypergraph Turán theorem via Lagrangians of intersecting families
• On graph-Lagrangians of hypergraphs containing dense subgraphs
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges
• On Lagrangians of \(r\)-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Hypergraphs do not jump
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• A Motzkin-Straus type result for 3-uniform hypergraphs
• Some results on Lagrangians of hypergraphs
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: On graph-Lagrangians and clique numbers of 3-uniform hypergraphs