@misc{Vahan_V._Mkrtchyan_On,
 author={Vahan V. Mkrtchyan and Vahe L. Musoyan and Anush V. Tserunyan},
 howpublished={online},
 publisher={Изд-во НАН РА},
 abstract={For a given graph consider the pairs of edge-disjoint matchings whose union contains as many edges as possible, and consider the relation of the cardinality of a maximum matching to the cardinality of the largest matching among such pairs. We show that 5=4 is a tight upper bound for this relation.},
 type={Հոդված},
 title={On edge-disjoint pairs of matchings},
 keywords={Mathematics, Graph theory},
}