Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs

DOI10.1007/S11083-017-9434-3zbMath1404.05135OpenAlexW2731233561MaRDI QIDQ722592

Pingge Chen, Yue Jian Peng

Publication date: 27 July 2018

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-017-9434-3

zbMATH Keywords

maximum cliquepolynomial optimizationTurán density

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hypergraph Turán theorem via Lagrangians of intersecting families
• Turán problems on non-uniform hypergraphs
• The connection between polynomial optimization, maximum cliques and Turán densities
• 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
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Non-uniform Turán-type problems
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs

This page was built for publication: Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs