Removable matchings in $2$-connected graphs
A matching $M$ of a $2$-connected graph $G$ is \emph{removable} if $G-M$ is $2$-connected. We prove that, for every integer $d\ge4$, every $2$-connected graph with at least $2d$ vertices and minimum degree at least $d$ has a removable matching of size $d$. This improves the previously known lower bound $d-2$ for $d\ge5...