Covering the edges of a graph with perfect matchings

Olha Silina

An $r$-graph is an $r$-regular graph with no odd cut of size less than $r$. A well-celebrated result due to Lovász says that for such graphs the linear system $Ax=\text{1}$ has…