Ramsey's theorem for finite graphs
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite graphs
|
| gptkbp:field |
combinatorics
graph theory |
| gptkbp:generalizes |
gptkb:pigeonhole_principle
|
| gptkbp:hasApplication |
gptkb:logic
discrete mathematics theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Ramsey's theorem for finite graphs
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedConcept |
gptkb:Ramsey_number
gptkb:Ramsey_theory |
| gptkbp:state |
For any given integer c and positive integer k, there exists a minimum number R(k; c) such that any c-coloring of the edges of a complete graph of order R(k; c) contains a monochromatic complete subgraph of order k.
|
| gptkbp:yearProposed |
1930
|
| gptkbp:bfsParent |
gptkb:Ramsey_theory
|
| gptkbp:bfsLayer |
5
|