Global maker-breaker games on sparse graphs

DOI10.1016/J.EJC.2010.09.005zbMath1203.91037OpenAlexW2004036580MaRDI QIDQ616371

Tibor Szabó, Miloš Stojaković, Dan Hefetz, Michael Krivelevich

Publication date: 7 January 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.09.005

Mathematics Subject Classification ID

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

Related Items (5)

Hitting time results for Maker-Breaker games ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Component Games on Regular Graphs ⋮ Hamiltonian Maker–Breaker Games on Small Graphs ⋮ The toucher-isolator game

Cites Work

• Unnamed Item
• Embedding nearly-spanning bounded degree trees
• On two problems regarding the Hamiltonian cycle game
• Random regular graphs of non-constant degree: concentration of the chromatic number
• Expanding graphs contain all small trees
• Blow-up lemma
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• Large bounded degree trees in expanding graphs
• Discrepancy games
• Tree embeddings
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Remarks on positional games. I
• Biased Positional Games
• Playing to Retain the Advantage
• Combinatorial Games
• A Solution of the Shannon Switching Game
• The Game of JumbleG

This page was built for publication: Global maker-breaker games on sparse graphs