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

DOI10.1002/RSA.3240050121MaRDI QIDQ4288892zbMATH OpenOpenAlexFDO

Authors 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

labelled treeslower boundpartitionperfect matchingprobability

Mathematics Subject Classification ID

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

Recommendations

• Matchings in random superpositions of bipartite trees
• On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
• scientific article; zbMATH DE number 1334618
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• scientific article; zbMATH DE number 2127722

Cites work

• Another Enumeration of Trees
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)

Cited in

(12)

• The number of trees with a 1-factor
• Alternating Whitney sums and matchings in trees. 1
• Matchings in random superpositions of bipartite trees
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• Random walks on trees and matchings
• Enumeration of matchings in complete q-ary trees
• On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
• Largest planar matching in random bipartite graphs
• On the expected number of edges in a maximum matching of an (r,s)-tree
• Tree matchings
• scientific article; zbMATH DE number 3895093 (Why is no real title available?)
• Superperfect pairs of trees in graphs

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

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