Alliance University, Bengaluru
Institutional Repository
Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7629| Title: | Minimizing the Number of Partial Matchings in Bipart ITE Graphs |
| Authors: | Oleg Pikhurko |
| Issue Date: | 2005 |
| Publisher: | Bulletin of the Institute of Combinatorics and Its Applications |
| Abstract: | Suppose that we know the vertex degrees in one part of a bipart ite graph G. We compute the smallest number of matchings of size m that G can have (provided there is at least one) . In fact, our results a lso apply to the more general problem of count ing matchings in matroids. |
| URI: | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7629 |
| Appears in Collections: | Articles to be qced |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Minimizing the Number of Partial Matchings.pdf | 1.23 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.