Properties (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Mathematical Concept
|
| gptkbp:are |
R(m, n) = R(n, m)
|
| gptkbp:defines |
R(m, n)
|
| gptkbp:evaluates |
recursive_formulas.
|
| gptkbp:has_implications_for |
theoretical computer science.
|
| gptkbp:hasPrograms |
network theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ramsey Numbers
|
| gptkbp:introduced |
gptkb:Frank_P._Ramsey
|
| gptkbp:is_a_center_for |
extremal combinatorics.
|
| gptkbp:is_part_of |
Ramsey_theory.
|
| gptkbp:is_popular_among |
R(m, n) where m and n are integers.
|
| gptkbp:is_studied_in |
discrete mathematics
|
| gptkbp:is_used_in |
computer science
combinatorial mathematics the existence of certain structures. |
| gptkbp:isConnectedTo |
game theory
|
| gptkbp:previousName |
Frank_P._Ramsey.
|
| gptkbp:reduces |
in both arguments.
|
| gptkbp:related_to |
graph theory
coloring problems. |
| gptkbp:represents |
the_minimum_number_of_vertices_required_to_ensure_a_complete_graph_contains_a_clique_of_size_m_or_an_independent_set_of_size_n.
|