On proving that a graph has no large clique: A connection with Ramsey theory (Q1351164)
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: On proving that a graph has no large clique: A connection with Ramsey theory |
scientific article; zbMATH DE number 984292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On proving that a graph has no large clique: A connection with Ramsey theory |
scientific article; zbMATH DE number 984292 |
Statements
On proving that a graph has no large clique: A connection with Ramsey theory (English)
0 references
27 February 1997
0 references
computational complexity
0 references
clique approximation
0 references
Ramsey theory
0 references
