Pages that link to "Item:Q1617049"
From MaRDI portal
The following pages link to Maximum cliques of hypergraphs and polynomial optimization (Q1617049):
Displaying 16 items.
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
- The connection between polynomial optimization, maximum cliques and Turán densities (Q528562) (← links)
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs (Q722592) (← links)
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications (Q906443) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- A homogeneous polynomial associated with general hypergraphs and its applications (Q2174504) (← links)
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs (Q2240668) (← links)
- On graphs with polynomially solvable maximum-weight clique problem (Q3809822) (← links)
- HOMOGENEOUS MULTILINEAR FUNCTIONS ON HYPERGRAPH CLIQUES (Q5357952) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Hard graphs for the maximum clique problem (Q5899769) (← links)
- Some Motzkin-Straus type results for non-uniform hypergraphs (Q5963619) (← links)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658) (← links)
