You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
To construct such a cover, let U be the set of unmatched vertices in L(possibly empty), and let Z be the set of vertices that are either in U or are connected to U U by alternating paths (paths that alternate between edges that are in the matching and edges that are not in the matching). Let K = ( L ∖ Z ) ∪ ( R ∩ Z ).