There is no fast method for finding monochromatic complete subgraphs (Q1052332)
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: There is no fast method for finding monochromatic complete subgraphs |
scientific article; zbMATH DE number 3815674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There is no fast method for finding monochromatic complete subgraphs |
scientific article; zbMATH DE number 3815674 |
Statements
There is no fast method for finding monochromatic complete subgraphs (English)
0 references
1983
0 references
2-coloration
0 references
infinite complete graph
0 references
monochromatic complete subgraph
0 references
