Codex Wiki
OurBigBook.com
Site
Source code
Diagonal Ramsey number
Home
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Ramsey theorem
OurBigBook.com
Words: 34
Articles: 1
The diagonal Ramsey number
R
(
t
)
is the least
n
such that every red-blue edge-colouring of
K
n
contains a monochromatic
K
t
.
Table of contents
34
1
Binomial upper bound for a Ramsey number
Diagonal Ramsey number
13
Ancestors
(6)
Ramsey theorem
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Solution
Solution