On Perfect Matchings and Hamilton Cycles in Sums of Random Trees

DOI10.1137/S0895480196313790MaRDI QIDQ4255816zbMATH OpenOpenAlexWikidataFDO

Authors Michal Karonski, Luboš Thoma, Alan Frieze

Publication date 27 June 1999

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480196313790

zbMATH Keywords

Hamilton cycleperfect matchingrandom trees

Mathematics Subject Classification ID

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

Recommendations

• Matchings in superpositions of (n, n)‐bipartite trees
• scientific article; zbMATH DE number 3950585
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph

Cited in

(7)

• Matchings in random superpositions of bipartite trees
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• Tree-Matchings in Graph Processes
• scientific article; zbMATH DE number 1334618 (Why is no real title available?)
• Matchings in superpositions of (n, n)‐bipartite trees
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• scientific article; zbMATH DE number 7650133 (Why is no real title available?)

This page was built for publication: On Perfect Matchings and Hamilton Cycles in Sums of Random Trees

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