The connection between polynomial optimization, maximum cliques and Turán densities

DOI10.1016/j.dam.2017.03.014zbMath1361.05092OpenAlexW2606709363MaRDI QIDQ528562

Biao Wu, Yue Jian Peng

Publication date: 12 May 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.014

zbMATH Keywords

hypergraphLagrangianmaximum cliquepolynomial optimizationTurán density

Mathematics Subject Classification ID

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

Related Items (3)

Maximum cliques of hypergraphs and polynomial optimization ⋮ Connection between continuous optimization and Turán densities of non-uniform hypergraphs ⋮ Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs

Cites Work

• A hypergraph Turán theorem via Lagrangians of intersecting families
• Turán problems on non-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
• Linear and nonlinear programming.
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Extremals of functions on graphs with applications to graphs and hypergraphs
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Some Motzkin-Straus type results for non-uniform hypergraphs
• Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs

This page was built for publication: The connection between polynomial optimization, maximum cliques and Turán densities