On disjoint matchings in cubic graphs

Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan

For $i=2,3$ and a cubic graph $G$ let ${\nu }_i(G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that ${\nu }_2(G)\ge 4/5|V(G)|$ and $ν_{3}(G)\ge…