Combinatorics Ramsey theory Concept
Ramsey number
Summary
The Ramsey number is the least such that every two-colouring of the edges of has a blue or a red . Ramsey numbers measure how large a structure must be to contain order. The node Ramsey number gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Ramsey's_theorem, lead section
About this page
| Tag | 0K9QVPJYJF |
|---|---|
| URI | m2://0K9QVPJYJF |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C55, 05D10 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.