Unformatted text preview: A  =  B  . Suppose that we have  N ( D )  >  D  for every proper nonempty subset D of A . Prove that for every edge e of G , there is a perfect matching containing e . 4. A deck of 52 playing cards is arranged in a rectangular grid of 4 rows and 13 columns. Prove that there is a set of 13 cards, all of diFerent values and in diFerent columns. 5. Determine a minimum cover for the ncube, for each n ≥ 0....
View
Full Document
 Fall '09
 M.PEI
 Math, Bipartite graph, Dulmage–Mendelsohn decomposition, A. Prove, bipartite matching algorithm

Click to edit the document details