## Complexity of a Disjoint Matching Problem on Bipartite Graphs

- Gregory J. Puleo
- Inf. Process. Lett.
- 2016

@inproceedings{Brczi2016SupermodularityIU, title={Supermodularity in Unweighted Graph Optimization II : Matroidal Term Rank Augmentation Krist{\'o}f B{\'e}rczi and Andr{\'a}s Frank July 2016}, author={Krist{\'o}f B{\'e}rczi and Andr{\'a}s Frank}, year={2016} }

- Published 2016

Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with matching number at least `. In a previous paper [1] by the authors, a generalization was developed for the case when the degrees are constrained by upper and lower bounds. Here two other extensions of Ryser's… CONTINUE READING

### Presentations referencing similar topics