# A group of eight friends is planning a vacation in Las Vegas, where they will split into different groups each evening to see various shows. Karen, Ryan, and Ruby want to see Cirque du Soleil together. Ruby, Anthony, and Jay want to see a magic show together. Anthony, Ricardo, and Heather want to see a comedy show together. Jenna, Ryan, and Ricardo want to See a tribute band play in Concert together. Karen, Jay, and Jenna want to see a musical together. Ricardo, Jay, and Heather want to see a play together. Draw a graph in which each vertex represents one of the shows, and connect vertices with an edge if at least one person wants to see both corresponding shows. Then use graph coloring to determine the fewest evenings needed so that all the friends can see the shows they would like to see, and design a schedule for the group.

### Mathematical Excursions (MindTap C...

4th Edition
Richard N. Aufmann + 3 others
Publisher: Cengage Learning
ISBN: 9781305965584

### Mathematical Excursions (MindTap C...

4th Edition
Richard N. Aufmann + 3 others
Publisher: Cengage Learning
ISBN: 9781305965584

#### Solutions

Chapter 5, Problem 12T
Textbook Problem

## Expert Solution

### Want to see the full answer?

Check out a sample textbook solution.

### Want to see this answer and more?

Experts are waiting 24/7 to provide step-by-step solutions in as fast as 30 minutes!*

*Response times vary by subject and question complexity. Median response time is 34 minutes and may be longer for new subjects.