Rainbow Matchings: existence and counting

Details Rainbow Matchings: existence and counting Rainbow Matchings: existence and counting

2011-04-14

arxiv.org/abs/1104.2702v1

Mathematics

Combinatorics

12 pages

Scientific paper

A perfect matching M in an edge-colored complete bipartite graph K_{n,n} is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of occurrences of a color. We also consider two natural models of random edge-colored K_{n,n} and show that, if the number of colors is at least n, then there is with high probability a random matching. This in particular shows that almost every square matrix of order n in which every entry appears at most n times has a Latin transversal.

Affiliated with

Also associated with

No associations

Rating

Rainbow Matchings: existence and counting 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 Rainbow Matchings: existence and counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rainbow Matchings: existence and counting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165524