Matchings in superpositions of (n,n)-bipartite trees

Pick two trees from among all “bipartite trees” with a fixed (n, n) two-coloring. We estimate the probability that the superposition of these two trees contains a perfect matching. As n →∞, this probability approaches 1. © 1994 John Wiley & Sons, Inc.