Playing to Retain the Advantage

DOI10.1017/S0963548310000064zbMath1198.05112MaRDI QIDQ4933596

Michael Krivelevich, Dan Hefetz, Noga Alon

Publication date: 14 October 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Global maker-breaker games on sparse graphs ⋮ The maker-breaker largest connected subgraph game ⋮ The biased odd cycle game ⋮ Maker-Breaker Games on Randomly Perturbed Graphs

Cites Work

• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Planarity, Colorability, and Minor Games
• Remarks on positional games. I
• Biased Positional Games
• A Solution of the Shannon Switching Game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Playing to Retain the Advantage