The connection between polynomial optimization, maximum cliques and Turán densities (Q528562)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The connection between polynomial optimization, maximum cliques and Turán densities |
scientific article; zbMATH DE number 6715088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The connection between polynomial optimization, maximum cliques and Turán densities |
scientific article; zbMATH DE number 6715088 |
Statements
The connection between polynomial optimization, maximum cliques and Turán densities (English)
0 references
12 May 2017
0 references
hypergraph
0 references
maximum clique
0 references
Lagrangian
0 references
Turán density
0 references
polynomial optimization
0 references
0 references
0 references
0.9410610198974608
0 references
0.9378442764282228
0 references
0.9290635585784912
0 references
0.8683406710624695
0 references
0.8429607152938843
0 references
