Given a graph, can we delete exactly k edges and the minimum degree of remaining graph is at least 4

418 Views Asked by At

Given a graph, can we delete exactly $k$ edges to make the minimum degree of remaining graph at least $4$?

Or given a graph what is the maximum number of edges can we delete to make every vertex in remaining graph has at least 4 degrees?