On the expected number of edges in a maximum matching of an (r,s)-tree

DOI10.1080/00207169508804386MaRDI QIDQ4876339zbMATH OpenOpenAlexFDO

Authors

Publication date 1 May 1996

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169508804386

zbMATH Keywords

matchingsexponential generating functions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the number of matchings of a tree
• Matchings in superpositions of (n, n)‐bipartite trees
• On the asymptotic behavior of the independence number of a random (n,n)-tree
• The number of maximum matchings in a tree

Cites work

• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• Asymptotic Methods in Enumeration
• Matchings in random superpositions of bipartite trees
• Matchings in superpositions of (n, n)‐bipartite trees
• The Enumeration of Point Labelled Chromatic Graphs and Trees

Cited in

(1)

• On the asymptotic behavior of the independence number of a random \((n,n)\)-tree

This page was built for publication: On the expected number of edges in a maximum matching of an (r,s)-tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876339)