Extremal Graph Theory and Ramsey Theory · Superchallenge problem

What is the smallest $n$ such that every red/blue coloring of the edges of $K_n$ contains a monochromatic path through $4$ vertices (3 edges)?