Задача 19.

* (Ramsey's theorem) 1) Show that for any natural (non-negative integer) numbers $m,n$ there is a natural number $k$ such that in any graph with $k$ vertices there are either $m$ pairwise connected vertices or $n$ pairwise disconnected. The smallest $k$ is denoted by $R(m,n)$. 2) Find $R(3,4)$.