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

DOI10.1002/rsa.3240050121zbMath0795.05106OpenAlexW2108430962MaRDI QIDQ4288892

Eric Schmutz

Publication date: 24 April 1994

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050121

zbMATH Keywords

partitionprobabilitylower boundperfect matchinglabelled trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph ⋮ On the expected number of edges in a maximum matching of an (r,s)-tree

Cites Work

• Another Enumeration of Trees
• Unnamed Item

This page was built for publication: Matchings in superpositions of (n, n)‐bipartite trees