2016/08/19 by Kristóf Bérczi, András Frank, Bérczi, Kristóf +1
Engineering · Computer Science · #graph theory and CDMA systems #Complexity and Algorithms in Graphs #Advanced Graph Theory Research
paper · pdf · doi:10.48550/arxiv.1608.05730
Ryser's max term rank formula with graph theoretic terminology is equivalent\nto a characterization of degree sequences of simple bipartite graphs with\nmatching number at least \ℓ. In a previous paper by the authors, a\ngeneralization was developed for the case when the degrees are constrained by\nupper and lower bounds. Here two other extensions of Ryser's theorem are\ndiscussed. The first one is a matroidal model, while the second one settles the\naugmentation version. In fact, the two directions shall be integrated into one\nsingle framework.\n