Maximal and maximum induced matchings in connected graphs

Bo-Jun Yuan, Zhao-Yu Yang, Lu Zheng +1

An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. Gupta et al. (2012,\cite{Gupta}) showed that every $n$-vertex graph has at most $10^…