Group: sci.op-research
From: arush
Date: Thursday, March 20, 2008 4:52 PM
Subject: Matchings in bipartite graphs

Hello,
I wanted to know if there is any theorem out there to calculate the
number of matched vertices in a bipartite graph. like halls theorem
gives you conditions for a graph to have a perfect matching , is there
anything which talks about the number of unmatched vertices.
Arush.