7. 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 5 teams. You will play a tournament next week in which every team will play every other team once. Each team can play at most one match each 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? FE b. Ten members of 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 recored 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. Student: B CDEFIG H Conflicts: BEJ ADG HI BF Al D B CI EH ACFI Hint For (a), you will want the teams to be vertices and games to be edges. Which does it make sense to color?

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter18: Deterministic Dynamic Programming
Section18.4: Resource-allocation Problems
Problem 3P
icon
Related questions
Question
7. 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 5 teams. You will play a tournament next week
in which every team will play every other team once. Each team can play
at most one match each 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? FE
b. Ten members of 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 recored 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.
Student:
B CDEFIG H
Conflicts: BEJ ADG HI BF Al D B CI EH ACFI
Hint
For (a), you will want the teams to be vertices and games to be edges. Which
does it make sense to color?
Transcribed Image Text:7. 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 5 teams. You will play a tournament next week in which every team will play every other team once. Each team can play at most one match each 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? FE b. Ten members of 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 recored 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. Student: B CDEFIG H Conflicts: BEJ ADG HI BF Al D B CI EH ACFI Hint For (a), you will want the teams to be vertices and games to be edges. Which does it make sense to color?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole