A generalization of the Motzkin-Straus theorem to hypergraphs
From MaRDI portal
Publication:1024737
DOI10.1007/s11590-008-0108-3zbMath1170.90504OpenAlexW1964823285MaRDI QIDQ1024737
Marcello Pelillo, Samuel Rota Bulò
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
Related Items (43)
Maximum cliques of hypergraphs and polynomial optimization ⋮ Connection between the clique number and the Lagrangian of 3-uniform hypergraphs ⋮ Chris Cannings: a life in games ⋮ A Motzkin-Straus type result for 3-uniform hypergraphs ⋮ Some results on Lagrangians of hypergraphs ⋮ Unnamed Item ⋮ A survey on the spectral theory of nonnegative tensors ⋮ The dominant eigenvalue of an essentially nonnegative tensor ⋮ On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph ⋮ A homogeneous polynomial associated with general hypergraphs and its applications ⋮ A Game-Theoretic Approach to Graph Clustering ⋮ On Motzkin-Straus type results for non-uniform hypergraphs ⋮ Even order uniform hypergraph via the Einstein product ⋮ A General Regularized Continuous Formulation for the Maximum Clique Problem ⋮ Clustering in Hypergraphs to Minimize Average Edge Service Time ⋮ Spectra of uniform hypergraphs ⋮ On some spectral radius inequalities for the Hadamard product of nonnegative tensors ⋮ H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph ⋮ Geometric simplicity of spectral radius of nonnegative irreducible tensors ⋮ An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications ⋮ On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs ⋮ Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues ⋮ Bounds for the greatest eigenvalue of positive tensors ⋮ The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph ⋮ On graph-Lagrangians of hypergraphs containing dense subgraphs ⋮ The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph ⋮ Two methods for the maximization of homogeneous polynomials over the simplex ⋮ On the uniqueness of the positive Z-eigenvector for nonnegative tensors ⋮ A new definition of geometric multiplicity of eigenvalues of tensors and some results based on it ⋮ On Lagrangians of \(r\)-uniform hypergraphs ⋮ Independent sets in graphs ⋮ Connection between continuous optimization and Turán densities of non-uniform hypergraphs ⋮ A continuous characterization of the maximum vertex-weighted clique in hypergraphs ⋮ A nonconvex quadratic optimization approach to the maximum edge weight clique problem ⋮ The connection between polynomial optimization, maximum cliques and Turán densities ⋮ The Laplacian of a uniform hypergraph ⋮ Computing hypermatrix spectra with the Poisson product formula ⋮ Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs ⋮ Spectral directed hypergraph theory via tensors ⋮ Adjacency spectra of random and complete hypergraphs ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
Uses Software
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
This page was built for publication: A generalization of the Motzkin-Straus theorem to hypergraphs
