Connection between the clique number and the Lagrangian of 3-uniform hypergraphs

DOI10.1007/s11590-015-0907-2zbMath1368.90164arXiv1312.7529OpenAlexW1551103917MaRDI QIDQ276313

Cheng Zhao, Qing-song Tang, Xiang-De Zhang, Yue Jian Peng

Publication date: 3 May 2016

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

Lagrangians of hypergraphspolynomial optimizationcolex orderingcliques of hypergraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (15)

An Irrational Lagrangian Density of a Single Hypergraph ⋮ Unnamed Item ⋮ Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions ⋮ Maximisers of the hypergraph Lagrangian outside the principal range ⋮ 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 ⋮ Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere ⋮ Lagrangian densities of linear forests and Turán numbers of their extensions ⋮ Two extremal problems related to orders ⋮ A note on generalized Lagrangians of non-uniform hypergraphs ⋮ Lagrangians of hypergraphs. II: When colex is best ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false ⋮ An irrational Turán density via hypergraph Lagrangian densities

Cites Work

• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• On graph-Lagrangians of hypergraphs containing dense subgraphs
• On Lagrangians of \(r\)-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Hypergraphs do not jump
• A Motzkin-Straus type result for 3-uniform hypergraphs
• A hypergraph extension of Turán's theorem
• Some results on Lagrangians of hypergraphs
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connection between the clique number and the Lagrangian of 3-uniform hypergraphs