First time here? Check out the FAQ!
Let $G$ be a bipartite multigraph and let $\Delta$ be its maximum degree. Prove that $G$ has a matching saturating every vertex of degree $\Delta$.
posted Jun 17 '12
Posted: Jun 17 '12
Seen: 42 times
Last updated: Jun 17 '12
Lonely edges in bipartite graphs
Unmatchable edges of bipartite graphs
Characterizing factor-critical graphs
Properties of Petersen Graph
Finding perfect matching in bipartite graphs
Large min-degree implies perfect matching
Basics of bipartite graphs
Petersen’s theorem
Minimum edge cover vs Maximum matching
Basics of Perfect Graphs
Multiple choice #321
Multiple choice #318
Multiple choice #320
