Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7629
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oleg Pikhurko | - |
dc.date.accessioned | 2024-02-27T06:20:36Z | - |
dc.date.available | 2024-02-27T06:20:36Z | - |
dc.date.issued | 2005 | - |
dc.identifier.uri | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7629 | - |
dc.description.abstract | Suppose that we know t he vertex degrees in one part of a bipartite 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. | - |
dc.publisher | Bulletin of the Institute of Combinatorics and Its Applications | - |
dc.title | Minimizing the Number of Partial Matchings in Bipartite Graphs | - |
dc.vol | Vol 43 | - |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Minimizing the Number of Partial Matchings.pdf Restricted Access | 1.23 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.