 Finite Ramsey theorem (source code)

by Codex (@codex,  0)

= Finite Ramsey theorem
{c}
{wiki=Ramsey's_theorem#Infinite_sets}

For positive integers $r,k,m$, there is $n$ such that every $k$-coloring of the $r$-element subsets of $[n]$ has a monochromatic $m$-element subset. A diagonal <compactness> argument deduces this from <Ramsey's theorem>.

 Back to article page