Each of the following problems can be solved by finding either the chromatic number of a graph or the chromatic index of a graph. For each problem, say whether you should find a proper coloring of the vertices or of the edges of the graph to solve the problem. Note: you likely don't have enough information to actually solve the problem, but this is okay. Just say in principle whether this is an edge-coloring or vertex-coloring application. ? 1. At a speed dating event, everyone must spend 5 minutes talking to another person before moving on to the next. How long must the event be? ? 2. At the world Tic-Tac-Toe championship, each player must play against 7 other players. New games start every hour. How many hours will the tournament take? ? 3. The math department wants to schedule common, day-long midterm exams over Spring Break, but obviously a student in two classes has to have their exams for those classes on different days (but this is the only problem with this plan). How many days are needed for exams? ? 4. Professor Snape stores potion ingrediants in as few cabinates as possible, but some ingrediants can't be stored in the same cabinate because they could interact dangerously. How many cabinates are required?
Each of the following problems can be solved by finding either the chromatic number of a graph or the chromatic index of a graph. For each problem, say whether you should find a proper coloring of the vertices or of the edges of the graph to solve the problem. Note: you likely don't have enough information to actually solve the problem, but this is okay. Just say in principle whether this is an edge-coloring or vertex-coloring application. ? 1. At a speed dating event, everyone must spend 5 minutes talking to another person before moving on to the next. How long must the event be? ? 2. At the world Tic-Tac-Toe championship, each player must play against 7 other players. New games start every hour. How many hours will the tournament take? ? 3. The math department wants to schedule common, day-long midterm exams over Spring Break, but obviously a student in two classes has to have their exams for those classes on different days (but this is the only problem with this plan). How many days are needed for exams? ? 4. Professor Snape stores potion ingrediants in as few cabinates as possible, but some ingrediants can't be stored in the same cabinate because they could interact dangerously. How many cabinates are required?
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question

Transcribed Image Text:Each of the following problems can be solved by finding either the chromatic number of a graph or the chromatic index of a graph.
For each problem, say whether you should find a proper coloring of the vertices or of the edges of the graph to solve the problem. Note: you
likely don't have enough information to actually solve the problem, but this is okay. Just say in principle whether this is an edge-coloring or
vertex-coloring application.
?
1. At a speed dating event, everyone must spend 5 minutes talking to another person before moving on to the next. How
long must the event be?
?
2. At the world Tic-Tac-Toe championship, each player must play against 7 other players. New games start every hour. How
many hours will the tournament take?
?
3. The math department wants to schedule common, day-long midterm exams over Spring Break, but obviously a student in
two classes has to have their exams for those classes on different days (but this is the only problem with this plan). How many days are
needed for exams?
?
4. Professor Snape stores potion ingrediants in as few cabinates as possible, but some ingrediants can't be stored in the
same cabinate because they could interact dangerously. How many cabinates are required?
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 1 steps

Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

