Maximum cliques of hypergraphs and polynomial optimization
From MaRDI portal
Recommendations
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- 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 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A global optimization approach for solving the maximum clique problem
- A new trust region technique for the maximum weight clique problem
- 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
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- Continuous Characterizations of the Maximum Clique Problem
- Evolution towards the maximum clique
- Exact bounds on the order of the maximum clique of a graph.
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Hypergraphs do not jump
- Linear and nonlinear programming.
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- The connection between polynomial optimization, maximum cliques and Turán densities
Cited in
(16)- A generalization of the Motzkin-Straus theorem to hypergraphs
- On the maxima of Motzkin-Straus programs and cliques of graphs
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs
- Homogeneous multilinear functions on hypergraph cliques
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Hard graphs for the maximum clique problem
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- 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
- Some Motzkin-Straus type results for non-uniform hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- On graphs with polynomially solvable maximum-weight clique problem
This page was built for publication: Maximum cliques of hypergraphs and polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617049)
