Smallest close to regular bipartite graphs without an almost perfect matching |
| |
| Authors: | Lutz Volkmann Axel Zingsem |
| |
| Institution: | 1. Lehrstuhl II für Mathematik, RWTH Aachen University, 52056, Aachen, Germany
|
| |
| Abstract: | A graph G is close to regular or more precisely a (d, d + k)-graph, if the degree of each vertex of G is between d and d + k. Let d ≥ 2 be an integer, and let G be a connected bipartite (d, d+k)-graph with partite sets X and Y such that |X| = |Y|+1. If G is of order n without an almost perfect matching, then we show in this paper that
|
|
