a) show that if a graph G has more than k vertices of degree > k then it cannot have a vertex cover of size k.

b) show that if every vertex in a graph G has degree <= k and G has more edges than k*l edges than it cannot have a vertex cover of size l.