On hypergraph cliques and polynomial programming

TL;DR

This paper explores the relationship between polynomial programming and clique problems in non-uniform hypergraphs, extending Motzkin-Straus type results to hypergraphs with edges of varying sizes.

Contribution

It generalizes the Motzkin-Straus theorem to non-uniform hypergraphs with edges of size 1, 2, and more, linking polynomial programming to hypergraph cliques.

Findings

Extended Motzkin-Straus results to non-uniform hypergraphs

Connected polynomial optimization with hypergraph clique characterization

Provided new insights into graph-Lagrangians for complex hypergraphs

Abstract

Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection provides a new proof of Tur\'an's theorem. Recently, an extension of Motzkin-Straus theorem was proved for non-uniform hypergraphs whose edges contain 1 or 2 vertices in \cite{PPTZ}. It is interesting if similar results hold for other non-uniform hypergraphs. In this paper, we give some connection between polynomial programming and the clique of non-uniform hypergraphs whose edges contain 1, or 2, and more vertices. Specifically, we obtain some Motzkin-Straus type results in terms of the graph-Lagrangian of non-uniform hypergraphs whose edges contain 1, or 2, and more vertices.