Meyniel's conjecture holds for random d‐regular graphs

DOI10.1002/rsa.20874zbMath1428.05285arXiv1510.03003OpenAlexW2963647147WikidataQ122871561 ScholiaQ122871561MaRDI QIDQ4973643

Paweł Prałat, Nicholas C. Wormald

Publication date: 28 November 2019

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

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

zbMATH Keywords

random graphscops and robbersvertex-pursuit games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Meyniel's conjecture on graphs of bounded degree ⋮ On the cop number of graphs of high girth

This page was built for publication: Meyniel's conjecture holds for random d‐regular graphs