1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
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 FieldValueLanguage
dc.contributor.authorOleg Pikhurko-
dc.date.accessioned2024-02-27T06:20:36Z-
dc.date.available2024-02-27T06:20:36Z-
dc.date.issued2005-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7629-
dc.description.abstractSuppose 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.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleMinimizing the Number of Partial Matchings in Bipartite Graphs-
dc.volVol 43-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Minimizing the Number of Partial Matchings.pdf
  Restricted Access		1.23 MBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.