Matchings
- From: arush <arushgadkar@xxxxxxxxx>
- Date: Thu, 20 Mar 2008 15:01:49 -0700 (PDT)
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.
.
- Follow-Ups:
- Re: Matchings
- From: Robert Israel
- Re: Matchings
- Prev by Date: Re: WHY HAS THIS SITE BECOME SUCH A SPAM TARGET???
- Next by Date: Expression Parser Utility
- Previous by thread: Censored, Truncated?
- Next by thread: Re: Matchings
- Index(es):
Relevant Pages
|