Ramsey's theorem for combinatorics

GPTKB entity

Statements (18)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:appliesTo graphs
hypergraphs
gptkbp:consequence existence of Ramsey numbers
gptkbp:field combinatorics
gptkbp:generalizes gptkb:pigeonhole_principle
https://www.w3.org/2000/01/rdf-schema#label Ramsey's theorem for combinatorics
gptkbp:namedAfter gptkb:Frank_P._Ramsey
gptkbp:publicationYear 1930
gptkbp:publishedIn gptkb:Proceedings_of_the_London_Mathematical_Society
gptkbp:relatedTo gptkb:Ramsey_theory
gptkbp:state In any coloring of the edges of a sufficiently large complete graph, there exists a monochromatic complete subgraph of a given size.
gptkbp:usedIn gptkb:logic
number theory
theoretical computer science
graph theory
gptkbp:bfsParent gptkb:Ramsey_theory
gptkbp:bfsLayer 5