Perfect Matchings in the Semirandom Graph Process
From MaRDI portal
Publication:5864217
DOI10.1137/21M1446939zbMath1490.05247arXiv2105.13455MaRDI QIDQ5864217
Calum MacRury, Paweł Prałat, Pu Gao
Publication date: 3 June 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.13455
05C80: Random graphs (graph-theoretic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C57: Games on graphs (graph-theoretic aspects)
Related Items
Power of \(k\) choices in the semi-random graph process, Sharp thresholds in adaptive random graph processes
Cites Work