On covering cubic graphs with three perfect matchings

Edita Máčajová, Ján Mazák

For a bridgeless cubic graph $G$, $m_3(G)$ is the ratio of the maximum number of edges of $G$ covered by the union of $3$ perfect matchings to $|E(G)|$. We prove that for any $r\in…