Find a maximal set of marriages (a complete matching, if possible) for A = 0 0 1 0 0 1 1
Chapter 8, Problem 8.4.6(choose chapter or problem)
Find a maximal set of marriages (a complete matching, if possible) for A = 0 0 1 0 0 1 1 0 1 1 0 1 1 0 1 0 0 1 1 0 0 0 0 1 0 and B = 1 1 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 1 0 0 1 0 0 0 0 . Sketch the network for B, with heavier lines on the edges in your matching.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer