# Three teachers x 1 , x 2 , x 3 teach four classes y 1 , y 2 , y 3 , y 4 for these numbers of periods: Show that this arrangement can be represented by a bipartite graph G and that a teaching schedule for one period corresponds to a matching in G. Set up a teaching schedule

Chapter 23, PROBLEM SET 23.8 #20

Three teachers x_{1}, x_{2}, x_{3} teach four classes y_{1}, y_{2}, y_{3}, y_{4} for these numbers of periods:

Show that this arrangement can be represented by a bipartite graph G and that a teaching schedule for one period corresponds to a matching in G. Set up a teaching schedule with the smallest possible number of periods.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: