Dibek, Cemil.
(Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2016., 2016.)
A graph with an upper bound on its matching number but without a bound on its maximum degree, or a graph with an upper bound on its maximum degree but without a bound on its matching number would have in nitely many edges. ...