# CS212 in-class exercise 02/17

# Problem 1

Prove that: if a group of people played tennis, it is always the case that an even number of people have played an odd number of games.

# Problem 2

Prove that: a graph with maximum degree at most k is (k + 1) colorable.

*Hint: One approach is by induction*