Extremal Graph Theory and Ramsey Theory · Hard problem

What is the smallest $n$ such that every red/blue coloring of the edges of $K_n$ has a vertex with $3$ edges of the same color?