Extremal Graph Theory and Ramsey Theory · Superchallenge problem

What is the minimum number of edges that must be deleted from $K_8$ to leave a triangle-free graph?