There is no fast method for finding monochromatic complete subgraphs (Q1052332): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(83)90006-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086631032 / rank | |||
Normal rank | |||
Revision as of 18:35, 19 March 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
