Eulerian and Hamiltonian Graphs · Challenge problem

From $K_8$ you may delete edges, as long as every vertex keeps degree at least $4$ (so Dirac's theorem still guarantees a Hamiltonian cycle). What is the largest number of edges you can delete?