On Edge-Disjoint Pairs Of Matchings

Simple item page
dc.creatorMkrtchyan, V. V.
dc.creatorMusoyan, V. L.
dc.creatorTserunyan, A. V.
dc.date2007-08-14
dc.date.accessioned2026-07-07T10:08:19Z
dc.date.available2026-07-07T10:08:19Z
dc.descriptionFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for |M|/|H|.
dc.description8 pages, 2 figures, Submitted to Discrete Mathematics
dc.identifierhttps://arxiv.org/abs/0708.1903
dc.identifierhttp://arxiv.org/abs/0708.1903
dc.identifierDiscrete Mathematics, 2008, Vol 308/23 pp 5823-5828
dc.identifierdoi:10.1016/j.disc.2007.09.061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170952
dc.subjectDiscrete Mathematics
dc.titleOn Edge-Disjoint Pairs Of Matchings
dc.typetext

Files

Collections

arXiv