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

DOI10.1007/S10255-021-1048-2zbMATH Open1477.05130OpenAlexW3207635322MaRDI QIDQ2240668FDOQ2240668

Authors: Xiaobing Guo, Yuejian Peng 

Publication date: 4 November 2021

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

Full work available at URL: https://doi.org/10.1007/s10255-021-1048-2

Recommendations

• Maximum cliques of hypergraphs and polynomial optimization
• Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• The connection between polynomial optimization, maximum cliques and Turán densities
• An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications

zbMATH Keywords

polynomial optimizationmaximum cliquehypergraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Cites Work

• Linear and nonlinear programming.
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• A note on generalized Lagrangians of non-uniform hypergraphs
• The connection between polynomial optimization, maximum cliques and Turán densities
• Some Motzkin-Straus type results for non-uniform hypergraphs
• Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
• An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• Maximum cliques of hypergraphs and polynomial optimization
• Dense 3-uniform hypergraphs containing a large clique
• Lagrangian densities of linear forests and Turán numbers of their extensions

Cited In (1)

• Non-jumping Turán densities of hypergraphs

This page was built for publication: Connection between continuous optimization and Turán densities of non-uniform hypergraphs

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