Ramsey's theorem for partitions
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
graphs
hypergraphs sets |
| gptkbp:consequence |
existence of unavoidable patterns in large structures
|
| gptkbp:describes |
conditions under which order must appear in large structures
|
| gptkbp:field |
gptkb:mathematics
combinatorics |
| gptkbp:form |
finite version
infinite version |
| gptkbp:generalizes |
gptkb:pigeonhole_principle
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ramsey's theorem for partitions
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:publicationYear |
1930
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Ramsey_number
gptkb:Ramsey_theory |
| gptkbp:state |
for any given coloring and size, there exists a minimum number such that any coloring yields a monochromatic subset
|
| gptkbp:usedIn |
gptkb:logic
theoretical computer science graph theory |
| gptkbp:bfsParent |
gptkb:Ramsey_theory
|
| gptkbp:bfsLayer |
5
|