Ramsey's theorem for infinite graphs
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
infinite graphs
|
| gptkbp:field |
combinatorics
graph theory |
| gptkbp:generalizes |
gptkb:finite_Ramsey's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ramsey's theorem for infinite graphs
|
| gptkbp:implies |
existence of large homogeneous sets in infinite graphs
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:publicationYear |
1930
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Ramsey's_theorem
|
| gptkbp:state |
Every infinite graph contains either an infinite clique or an infinite independent set.
|
| gptkbp:usedIn |
gptkb:logic
gptkb:set_theory theoretical computer science |
| gptkbp:bfsParent |
gptkb:Ramsey_theory
|
| gptkbp:bfsLayer |
5
|