On spectral conditions for fractional $k$-extendable graphs

Xiyan Bai, Tao Wang, Mengke Yang +1

A fractional matching of a graph $G$ is a function $h:E(G)\to [0,1]$ such that ${\sum }_{e\in E_G(v)}h(e)\le 1$ for every vertex $v\in V(G)$, where $E_G(v)$ is the set of edges…