Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
graphs
hypergraphs |
| gptkbp:field |
gptkb:combinatorics
|
| gptkbp:firstPublished |
1930
|
| gptkbp:generalizes |
gptkb:pigeonhole_principle
|
| gptkbp:implies |
existence of Ramsey numbers
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:relatedTo |
gptkb:Ramsey's_theorem
gptkb:Ramsey_theory |
| gptkbp:state |
for any given coloring and integers, there exists a minimum number such that any coloring of a complete graph of that size contains a monochromatic clique of the given size
|
| gptkbp:usedIn |
gptkb:theoretical_computer_science
gptkb:logic extremal combinatorics |
| gptkbp:bfsParent |
gptkb:Ramsey's_theorem_for_infinite_graphs
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
finite Ramsey's theorem
|