Question 1
In a round-robin tournament with 10 teams, each round consists of disjoint matches (no team plays twice in a round). What is the minimum number of rounds needed?
Step-by-step solution:
1. **Model as edge coloring of complete graph K_10
2. Vizing's theorem: χ'(K_n) = n-1 for even n, n for odd n
3. For 10 teams: 9 colors/rounds needed
Answer: 9 rounds
1. **Model as edge coloring of complete graph K_10
2. Vizing's theorem: χ'(K_n) = n-1 for even n, n for odd n
3. For 10 teams: 9 colors/rounds needed
Answer: 9 rounds