There is no fast method for finding monochromatic complete subgraphs (Q1052332): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:20, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There is no fast method for finding monochromatic complete subgraphs |
scientific article |
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
