A generalization of the Motzkin-Straus theorem to hypergraphs

DOI10.1007/s11590-008-0108-3zbMath1170.90504MaRDI QIDQ1024737

Samuel Rota Bulò, Marcello Pelillo

Publication date: 17 June 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0108-3

zbMATH Keywords

maximum clique; polynomial optimization

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Spectra of uniform hypergraphs, H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph, Geometric simplicity of spectral radius of nonnegative irreducible tensors, A Motzkin-Straus type result for 3-uniform hypergraphs

Uses Software

• QUALEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• Spectral bounds for the clique and independence numbers of graphs
• Hypergraphs do not jump
• 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 PTAS for the minimization of polynomials of fixed degree over the simplex
• A hypergraph extension of Turán's theorem
• Global Optimization with Polynomials and the Problem of Moments
• A global optimization approach for solving the maximum clique problem
• A Continuous-Based Approach for Partial Clique Enumeration
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
• The Eigenvalues of a Graph and Its Chromatic Number
• An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology