Maximum cliques of hypergraphs and polynomial optimization

DOI10.1007/s10255-018-0796-0zbMath1402.05155OpenAlexW2894816510MaRDI QIDQ1617049

Yan-Ming Chang, Yue Jian Peng

Publication date: 7 November 2018

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

Full work available at URL: https://doi.org/10.1007/s10255-018-0796-0

zbMATH Keywords

hypergraphmaximum cliquepolynomial optimization

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• QUALEX

Cites Work

• The connection between polynomial optimization, maximum cliques and Turán densities
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• 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
• Linear and nonlinear programming.
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Hypergraphs do not jump
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Evolution towards the maximum clique
• Exact bounds on the order of the maximum clique of a graph.
• A new trust region technique for the maximum weight clique problem
• A global optimization approach for solving the maximum clique problem
• Continuous Characterizations of the Maximum Clique Problem
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum cliques of hypergraphs and polynomial optimization