On saturation problems for matchings with regularity constraints

Gang Yang, Zixuan Yang, Shenggui Zhang

A graph $G$ is $F$-saturated if $G$ is $F$-free but for any edge $e$ in the complement of $G$ the graph $G+e$ contains $F$. Gerbner et al. (Discrete Math., 345 (2022), 112921) in…