The two problems below can be solved using graph coloring. For each problem, represent the situation with a

graph, say whether you should be coloring vertices or edges and why, and use the coloring to solve the

problem.

a$.$ Your Quidditch league has $9$ teams. You will play a toumament next week in which every team will play

every other team once. Each team can play at most one match per day, but there is plenty of time in the day

for multiple matches. What is the fewest number of days over which the tournament can take place?

Are you coloring vertices or edges, and why?

Choose an answe

What is the fewest number of days over which the toumament can take place?

b$.$ Ten members of the math club are driving to a math conference in a neighboring state. However, some of

these students have dated in the past, and things are still a little awkward. Each student lists which other

students they refuse to share a car with; these conflicts are recorded in the table below. What is the fewest

number of cars the club needs to make the trip? Do not worry about running out of seats, just avoid the

conflicts.

Are you coloring vertices or edges, and why?

Choose an answer: Select an answer

What is the fewest number cars the club needs to make the trip?