The random k‐matching‐free process

DOI10.1002/rsa.20814zbMath1405.05164arXiv1708.01054OpenAlexW2962960464MaRDI QIDQ4625024

Matthew Kwan, Michael Krivelevich, Po-Shen Loh, Benjamin Sudakov

Publication date: 20 February 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.01054

zbMATH Keywords

matchingrandom processrandom graph

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 (4)

The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes ⋮ A randomized construction of high girth regular graphs ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ The Kőnig graph process

This page was built for publication: The random k‐matching‐free process