REVIEW
Rainbow Matchings: existence and counting
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Discussion (0). Continue with ORCID to comment.