Strong games played on random graphs

zbMath1355.05169arXiv1507.04229MaRDI QIDQ510354

Pascal Pfister, Asaf Ferber

Publication date: 17 February 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsperfect matchingpositional 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Winning strong games through fast strategies for weak games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• Equitable coloring of random graphs
• An algorithm for finding hamilton cycles in random directed graphs
• Regularity and Positional Games
• Combinatorial Games

This page was built for publication: Strong games played on random graphs