Ramsey numbers R(m,n)

Layer 0 — Mathematicsin the graph-theory subtree

Smallest N such that any 2-coloring of K_N contains red K_m or blue K_n. R(3,3)=6, R(4,4)=18, R(5,5) ∈ [43,48]. Probabilistic bounds exponential.

Related concepts

Explore Ramsey numbers R(m,n) on the interactive knowledge graph →