Winning Fast in Sparse Graph Construction Games

DOI10.1017/S0963548308009401MaRDI QIDQ3608334zbMATH OpenFDO

Authors 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)

Recommendations

• Global maker-breaker games on sparse graphs
• Fast winning strategies in maker-breaker games
• Size Ramsey number of bounded degree graphs for games
• Building spanning trees quickly in maker-breaker games
• Building spanning trees quickly in maker-breaker games

Cites work

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

Cited in

(6)

• The positive minimum degree game on sparse graphs
• Game matching number of graphs
• Surplus of Graphs and the Lovász Local Lemma
• The Game Saturation Number of a Graph
• Hitting time results for maker-breaker games
• Size Ramsey number of bounded degree graphs for games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608334)