Matchings in random superpositions of bipartite trees

DOI10.1016/0377-0427(92)90249-WzbMath0767.05075MaRDI QIDQ1195420

Edgar M. Palmer

Publication date: 26 October 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect matchingbipartite treesrandom superpositions

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the asymptotic behavior of the independence number of a random \((n,n)\)-tree ⋮ On the expected number of edges in a maximum matching of an (r,s)-tree

Cites Work

• The Enumeration of Locally Restricted Graphs (I)
• The rediscovery of Redfield's papers
• The Enumeration Methods of Redfield
• The Enumeration of Locally Restricted Graphs (II)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matchings in random superpositions of bipartite trees