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

DOI10.1007/S11083-017-9434-3MaRDI QIDQ722592zbMATH OpenOpenAlexFDO

Authors Pingge Chen, Yuejian 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

polynomial optimizationmaximum cliqueTurán density

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• 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
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Non-uniform Turán-type problems
• The connection between polynomial optimization, maximum cliques and Turán densities
• Turán problems on non-uniform hypergraphs

Cited in

(8)

• A generalization of the Motzkin-Straus theorem to hypergraphs
• Connection between continuous optimization and Turán densities of non-uniform hypergraphs
• Homogeneous multilinear functions on hypergraph cliques
• Maximum cliques of hypergraphs and polynomial optimization
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
• A homogeneous polynomial associated with general hypergraphs and its applications
• The connection between polynomial optimization, maximum cliques and Turán densities
• 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

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