On non-feasible edge sets in matching-covered graphs

Xiao Zhao, Fengming Dong, Sheng Chen

Let $G=(V,E)$ be a matching-covered graph and $X$ be an edge set of $G$. $X$ is said to be feasible if there exist two perfect matchings $M_1$ and $M_2$ in $G$ such that $|M_1\cap…