Ramsey Number proof: $R(3,3,3,3)\leq 4(R(3,3,3)-1) + 2$

Question

I am trying to prove:

$R(3,3,3,3)\leq 4(R(3,3,3)-1) + 2$

I am confused as to how one can go from a $4$ color problem to a $3$ color problem by multiplying and adding.

edit: $R$ is the Ramsey number

Answer 1

(Big hint/spoiler)

Consider a graph of order $4(R(3,3,3)−1)+2$ whose edges are coloured using four colours. Pick a vertex $x$, and for each $1\leq i\leq 4$ let $V_i$ denote the set of vertices whose edge to $x$ uses the $i$'th colour. By the pigeonhole principle, some $V_i$ has order at least $R(3,3,3)$. Now consider two cases:

• some edge in $V_i$ uses colour $i$
• no edge in $V_i$ uses colour $i$