Winning Fast in Sparse Graph Construction Games

DOI10.1017/S0963548308009401zbMath1169.91320MaRDI QIDQ3608334

Michael Krivelevich, Ohad Noy Feldheim

Publication date: 4 March 2009

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

zbMATH Keywords

lower boundcomplete graphmaker-breaker gamenumber of rounds

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (4)

Hitting time results for Maker-Breaker games ⋮ Game matching number of graphs ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ The Game Saturation Number of a Graph

Cites Work

• Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
• Ramsey games
• Deterministic Graph Games and a Probabilistic Intuition
• A Winning Strategy for the Ramsey Graph Game
• Positional Games
• On a combinatorial game

This page was built for publication: Winning Fast in Sparse Graph Construction Games