Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
DOI10.1007/S11083-017-9434-3zbMATH Open1404.05135OpenAlexW2731233561MaRDI QIDQ722592FDOQ722592
Authors: Pingge Chen, Yuejian Peng 
Publication date: 27 July 2018
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-017-9434-3
Recommendations
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
- 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
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Lagrangians of Hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Title not available (Why is that?)
- A hypergraph Turán theorem via Lagrangians of intersecting families
- Turán problems on non-uniform hypergraphs
- Non-uniform Turán-type problems
- 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
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
Cited In (8)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Homogeneous multilinear functions on hypergraph cliques
- The connection between polynomial optimization, maximum cliques and Turán densities
- Maximum cliques of hypergraphs and polynomial optimization
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A homogeneous polynomial associated with general hypergraphs and its applications
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs
This page was built for publication: Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722592)
