Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
colorings
infinite graphs |
| gptkbp:citation |
Ramsey, F. P. (1930). On a problem of formal logic. Proceedings of the London Mathematical Society, 30(4), 264–286.
|
| gptkbp:field |
gptkb:set_theory
combinatorics |
| gptkbp:generalizes |
gptkb:finite_Ramsey_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
infinite Ramsey theorem
|
| gptkbp:implies |
compactness theorem for first-order logic
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:provenBy |
gptkb:Frank_P._Ramsey
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
partition calculus |
| gptkbp:state |
for any coloring of the edges of a countably infinite complete graph with finitely many colors, there exists an infinite monochromatic complete subgraph
|
| gptkbp:yearProved |
1930
|
| gptkbp:bfsParent |
gptkb:Ramsey_theory
|
| gptkbp:bfsLayer |
5
|