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 x1, x2, x3 teach four classes y1, y2, y3, y4 for these numbers of periods:

image

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 answer-question

Advanced Engineering Mathematics

10th edition

Authors: Erwin Kreyszig

ISBN: 978-0470458365