  We consider the problem of finding a large rainbow matching in a random graph
with randomly colored edges. In particular we analyze the performance of two
greedy algorithms for this problem. The algorithms we study are colored
versions of algorithms that were previously used to find large matchings in
random graphs (i.e. the color-free version of our present problem).
