Semi‐random graph process

DOI10.1002/rsa.20887zbMath1442.05203arXiv1805.02259OpenAlexW2981917538MaRDI QIDQ5113951

Clara Shikhelman, Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Miloš Stojaković, Olaf Parczyk

Publication date: 19 June 2020

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

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

zbMATH Keywords

random graphsgraph processesone-player games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

On the Power of Choice for Boolean Functions ⋮ Power of \(k\) choices in the semi-random graph process ⋮ Sharp thresholds in adaptive random graph processes ⋮ Hamilton cycles in the semi-random graph process ⋮ Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process ⋮ Perfect Matchings in the Semirandom Graph Process

This page was built for publication: Semi‐random graph process