Graph Coloring · Challenge problem

$K_5$ has $\chi(K_5)=5$. What is the minimum number of edges that must be DELETED from $K_5$ so that the remaining graph can be properly colored with only $4$ colors?