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

DOI10.1007/s10255-021-1048-2zbMath1477.05130OpenAlexW3207635322MaRDI QIDQ2240668

Xiaobing Guo, Yue Jian 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

zbMATH Keywords

hypergraphmaximum cliquepolynomial optimization

Mathematics Subject Classification ID

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

Cites Work

• A note on generalized Lagrangians of non-uniform hypergraphs
• The connection between polynomial optimization, maximum cliques and Turán densities
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• 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
• Maximum cliques of hypergraphs and polynomial optimization
• Dense 3-uniform hypergraphs containing a large clique
• 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
• Lagrangian densities of linear forests and Turán numbers of their extensions

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