Talk:Claude Berge
From Wikipedia, the free encyclopedia
 |
This article is within the scope of WikiProject Biography. For more information, visit the project page. | ||
| ??? | This article has not yet received a rating on the Project's quality scale. Please rate the article and then leave a short summary here to explain the ratings and/or to identify the strengths and weaknesses of the article. [FAQ] | ||
 |
Claude Berge is within the scope of WikiProject France, an attempt to build a comprehensive and detailed guide to France and Monaco on Wikipedia. If you would like to participate, please join the project and help with our open tasks. | |
 |
||
| Stub | This article has been rated as stub-Class on the Project's quality scale. (If you rated the article please give a short summary at comments, explaining the ratings and/or suggest improvements.) |
|
[edit] Berge's lemma
Need something about Berge's lemma in graph theory, which states that a matching M in a graph G is maximum if and only if there is in G no augmenting path with respect to M. DFH 21:46, 6 February 2007 (UTC)
