Matchings in random superpositions of bipartite trees

0.00 Avg rating—0 Votes

Article ID:	iaor1993643
Country:	Netherlands
Volume:	41
Issue:	1/2
Start Page Number:	199
End Page Number:	204
Publication Date:	Aug 1992
Journal:	Journal of Computational and Applied Mathematics
Authors:	Palmer E.N.

Abstract:

The paper considers the superpositions of r≥2 bipartite trees with n vertices in each bipartite set and find that for r≥2 almost all superpositions have a perfect matching. When r=2, at least 98% of all superpositions have perfect matchings.

Reviews

Required fields are marked *. Your email address will not be published.