A graph has a vertex cover of size 4. What can you conclude?
The graph has at most 4 vertices
The graph has at most 4 edges
Every edge has at least one endpoint in any set of 4 vertices
The graph is 4-colorable