Tree-Matchings in Graph Processes

DOI10.1137/0404011MaRDI QIDQ3971235zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak, Andrzej Ruciński

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

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

Recommendations

• The random k-matching-free process
• Perfect matchings in random subgraphs of regular bipartite graphs
• scientific article; zbMATH DE number 1334618
• On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
• Complete matchings in random subgraphs of the cube

Cited in

(9)

• Matching and covering the vertices of a random graph by copies of a given graph
• On resilience of connectivity in the evolution of random graphs
• Perfect matchings in random intersection graphs
• Multitrees in random graphs
• Packing tree factors in random and pseudo-random graphs
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Nonvertex-balanced factors in random graphs
• Tilings in randomly perturbed dense graphs
• Tiling random regular graphs efficiently

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

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