Ramsey's theorem (Q6482870)
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: [[]] |
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ramsey's theorem |
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques |
Statements
Combinatorics
0 references
Identifiers
RamseysTheorem
0 references
44115641
0 references
1 reference
Ramsey_theorem
0 references
ramsey
0 references
