Ramsey's theorem for hypergraphs
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:uniform_hypergraphs
|
| gptkbp:field |
combinatorics
|
| gptkbp:firstPublished |
1930
|
| gptkbp:generalizes |
gptkb:Ramsey's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ramsey's theorem for hypergraphs
|
| gptkbp:namedAfter |
gptkb:Frank_P._Ramsey
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
gptkb:hypergraph |
| gptkbp:state |
for any given integers k and r, there exists a minimum number N such that any r-coloring of the k-element subsets of an N-element set contains a monochromatic subset of size m
|
| gptkbp:usedIn |
extremal combinatorics
|
| gptkbp:bfsParent |
gptkb:Ramsey_theory
|
| gptkbp:bfsLayer |
5
|