Global maker-breaker games on sparse graphs
From MaRDI portal
Publication:616371
DOI10.1016/J.EJC.2010.09.005zbMATH Open1203.91037OpenAlexW2004036580MaRDI QIDQ616371FDOQ616371
Authors: Dan Hefetz, Michael Krivelevich, Miloš Stojaković, Tibor Szabó 
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
Recommendations
Cites Work
- Tree embeddings
- Embedding nearly-spanning bounded degree trees
- Expanding graphs contain all small trees
- Large bounded degree trees in expanding graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Blow-up lemma
- Remarks on positional games. I
- Biased Positional Games
- Combinatorial Games
- A Solution of the Shannon Switching Game
- On two problems regarding the Hamiltonian cycle game
- A sharp threshold for the Hamilton cycle Maker–Breaker game
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- Random regular graphs of non-constant degree: concentration of the chromatic number
- Discrepancy games
- Title not available (Why is that?)
- Playing to retain the advantage
- The Game of JumbleG
Cited In (12)
- Spanning tree game as prim would have played
- On a base exchange game on bispanning graphs
- Building spanning trees quickly in maker-breaker games
- The positive minimum degree game on sparse graphs
- Maker-Breaker total domination game on cubic graphs
- Winning Fast in Sparse Graph Construction Games
- Hamiltonian maker-breaker games on small graphs
- Hitting time results for maker-breaker games
- Playing to retain the advantage
- The toucher-isolator game
- Surplus of Graphs and the Lovász Local Lemma
- Component games on regular graphs
This page was built for publication: Global maker-breaker games on sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616371)
