A graph has a perfect matching. Which of the following must be true?
The number of vertices is even.
The graph is connected.
The graph contains a Hamiltonian cycle.
The graph is bipartite.