A graph has an edge connectivity of 3. What can you conclude?
It has at least 4 vertices
Removing 2 edges can disconnect it
It has minimum degree at least 3
It is 3-connected