The connection between polynomial optimization, maximum cliques and Turán densities (Q528562): Difference between revisions

@@ Property / cites work @@
+Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Extremal problems whose solutions are the blowups of the small Witt- designs
+Normal rank
@@ Property / cites work @@
+Some Motzkin-Straus type results for non-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+A hypergraph Turán theorem via Lagrangians of intersecting families
+Normal rank
@@ Property / cites work @@
+Turán problems on non-uniform hypergraphs
@@ Property / cites work: Turán problems on non-uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear and nonlinear programming.
@@ Property / cites work: Linear and nonlinear programming. / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
+Normal rank
@@ Property / cites work @@
+A generalization of the Motzkin-Straus theorem to hypergraphs
+Normal rank
@@ Property / cites work @@
+Extremals of functions on graphs with applications to graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Lagrangians of Hypergraphs
@@ Property / cites work: Lagrangians of Hypergraphs / rank @@
+Normal rank