There is no fast method for finding monochromatic complete subgraphs (Q1052332): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some remarks on the theory of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a combinatorial game / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065548 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 14 June 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
