Covering the edges of a graph with perfect matchings

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=\mathbf{\text{1}}$ has a solution in $\mathbb{Z}\mathrm{/}2$, where $A$ is the $0,1$ edge to perfect matching incidence matrix. Note that we allow $x$ to have negative entries. In this paper, we present an improved version of Lovász’s result, proving that, in fact, there is a solution $x$ with all entries being either integer or $+1\mathrm{/}2$ and corresponding to a linearly independent set of perfect matchings. Moreover, the total number of $+1\mathrm{/}2$’s is at most $6k$, where $k$ is the number of Petersen bricks in the tight cut decomposition of the graph.