Matching extension and matching exclusion via the size or the spectral radius of graphs

Shujing Miao, Shuchao Li, Wei Wei

A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-exclu…