On upper bounds for parameters related to construction of special maximum matchings

Artur Khojabaghyan, Vahan V. Mkrtchyan

For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that…