On Perfect Matchings and Hamilton Cycles in Sums of Random Trees

DOI10.1137/S0895480196313790zbMath0922.05047OpenAlexW2079378642WikidataQ57401542 ScholiaQ57401542MaRDI QIDQ4255816

Michał Karoński, Lubos Thoma, Alan M. 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

perfect matchingrandom treesHamilton cycle

Mathematics Subject Classification ID

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

Related Items (2)

Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph ⋮ Unnamed Item

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