Extremal Graph Theory and Ramsey Theory · Hard problem

Color each edge of $K_n$ red or blue at random. The expected number of monochromatic $K_4$'s is $\binom n4\,2^{1-6}$. What is the largest $n$ for which this expectation is less than $1$ (so that some coloring has no monochromatic $K_4$)?