Ramsey's theorem for triples
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:author |
gptkb:Frank_P._Ramsey
|
| gptkbp:field |
gptkb:Ramsey_theory
combinatorics |
| gptkbp:generalizes |
gptkb:Ramsey's_theorem_for_pairs
Ramsey's theorem for n-tuples |
| https://www.w3.org/2000/01/rdf-schema#label |
Ramsey's theorem for triples
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:publicationYear |
1930
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:sentence |
For any coloring of the 3-element subsets of an infinite set with finitely many colors, there exists an infinite subset such that all 3-element subsets of it have the same color.
|
| gptkbp:bfsParent |
gptkb:Ramsey_theory
|
| gptkbp:bfsLayer |
5
|