Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs

Details Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs

2005-12-30

arxiv.org/abs/math/0512653v4

Mathematics

Combinatorics

This paper has been withdrawn

Scientific paper

This paper has been withdrawn by the author(s), due an error in the proof.

Affiliated with

Also associated with

No associations

Rating

Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs 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 Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507751