eight! 2.4. Prove that if a graph G has exactly two vertices u and u of odd degree, then G has a u, v-path. [Hint: Assume the contrary, then use Corollary 1.27 on page 18.] 2.5. What is the minimum number of edges a simple graph on n vertices must have. so