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

DOI10.1016/J.DAM.2017.03.014zbMATH Open1361.05092OpenAlexW2606709363MaRDI QIDQ528562FDOQ528562

Authors Biao Wu, Yuejian 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

polynomial optimizationmaximum cliquehypergraphLagrangianTurán density

Mathematics Subject Classification ID

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

Recommendations

• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• Maximum cliques of hypergraphs and polynomial optimization
• Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
• Connection between continuous optimization and Turán densities of non-uniform hypergraphs
• On Lagrangians of \(r\)-uniform hypergraphs

Cites work

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

Cited in

(4)

• Connection between continuous optimization and Turán densities of non-uniform hypergraphs
• Maximum cliques of hypergraphs and polynomial optimization
• Connection between polynomial optimization and maximum cliques of 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528562)