On Edge-Disjoint Pairs Of Matchings

Details On Edge-Disjoint Pairs Of Matchings On Edge-Disjoint Pairs Of Matchings

2007-08-14

arxiv.org/abs/0708.1903v1

Discrete Mathematics, 2008, Vol 308/23 pp 5823-5828

Computer Science

Discrete Mathematics

8 pages, 2 figures, Submitted to Discrete Mathematics

Scientific paper

10.1016/j.disc.2007.09.061

For 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|.

Affiliated with

Also associated with

No associations

Rating

On Edge-Disjoint Pairs Of Matchings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Edge-Disjoint Pairs Of Matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Edge-Disjoint Pairs Of Matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-389626