Graphs with restricted valency and matching number

Niranjan Balachandran, Niraj Khare

Consider the family of all finite graphs with maximum degree $\Delta (G)<d$ and matching number $\nu (G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number…