I have this problem in my Question paper for the BE exam I appeared. I am not able to understand the problem statement and dont know how to use max flow min cut theorem to use it.
Please guide me through this. The problem statement is as below.
Students p, q, r, s, t are members of three committees A, B, and C; r and s belong to committee A; p, r, t belong to committee B and p, q and t belong to committee C. Each committee is to select a student representative. Use the Max-flow-Min-cut theorem to determine if a selection be made such that each committee has a distinct representative?