Pseudo-Matchings of a Bipartite Graph
Alan Brace, D Daykin · Proceedings of the American Mathematical Society · 1974
Let G be a graph whose edges (x, y) have $x \in X,y \in Y,|X| = |Y| < \infty$ . A (t, u) cover of G is a set of t edges which cover $\geqq u$ vertices in both X and Y. We give conditions on the valency (minimum local degree) and the number of edges which ensure a (t, u) cover or that a Hamiltonian circuit exists.