QP-2009-04

Restricted t-matchings in Bipartite Graphs

Zoltán Király



Abstract

The results contained in this paper were achieved in 1999, when the author participated the "Workshop on Matroids, Matching and Extensions" in Waterloo, Canada. This paper was written and distributed in 2001, when the author gave an EIDMA minicurse in Eindhoven, Netherlands. This is the uncorrected original version, except, that we added an Appendix containing the NP-completeness proof for the weighted K2,2-free factor problem.


Bibtex entry:

@techreport{egresqp-09-04,
AUTHOR = {Kir{\'a}ly, Zolt{\'a}n},
TITLE = {Restricted t-matchings in Bipartite Graphs},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2009},
NUMBER = {QP-2009-04}
}


Last modification: 9.1.2018. Please email your comments to Tamás Király!