Tree-Matchings in Graph Processes

DOI10.1137/0404011zbMath0766.05078OpenAlexW2072508453MaRDI QIDQ3971235

Andrzej Ruciński, Tomasz Łuczak

Publication date: 25 June 1992

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

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

zbMATH Keywords

hitting timesrandom graphtree matchings

Mathematics Subject Classification ID

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

Related Items (8)

On resilience of connectivity in the evolution of random graphs ⋮ Packing tree factors in random and pseudo-random graphs ⋮ Multitrees in random graphs ⋮ Perfect matchings in random intersection graphs ⋮ Perfect Matchings in Random r-regular, s-uniform Hypergraphs ⋮ Matching and covering the vertices of a random graph by copies of a given graph ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Nonvertex‐Balanced Factors in Random Graphs

This page was built for publication: Tree-Matchings in Graph Processes