Tree-Matchings in Graph Processes

DOI10.1137/0404011zbMATH Open0766.05078OpenAlexW2072508453MaRDI QIDQ3971235FDOQ3971235

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

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

zbMATH Keywords

random graphhitting timestree matchings

Mathematics Subject Classification ID

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

Cited In (8)

• Multitrees in random graphs
• Tilings in randomly perturbed dense graphs
• Packing tree factors in random and pseudo-random graphs
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Perfect matchings in random intersection graphs
• Nonvertex-balanced factors in random graphs
• 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

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)