Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
theoretical computer science
graph theory |
| gptkbp:defines |
The minimum number n such that any edge coloring of the complete graph K_n with c colors contains a monochromatic subgraph isomorphic to a given graph.
|
| gptkbp:field |
combinatorics
|
| gptkbp:generalizes |
gptkb:Ramsey_number
|
| https://www.w3.org/2000/01/rdf-schema#label |
multicolor Ramsey number
|
| gptkbp:introduced |
gptkb:Frank_P._Ramsey
|
| gptkbp:notation |
R(G_1, G_2, ..., G_c)
|
| gptkbp:relatedTo |
gptkb:Ramsey_number
gptkb:Ramsey_theory |
| gptkbp:bfsParent |
gptkb:Ramsey_number
|
| gptkbp:bfsLayer |
5
|