Recommendations
Cites work
- scientific article; zbMATH DE number 1354920 (Why is no real title available?)
- A Solution of the Shannon Switching Game
- A sharp threshold for the Hamilton cycle Maker–Breaker game
- Biased Positional Games
- Blow-up lemma
- Combinatorial Games
- Discrepancy games
- Edge-Disjoint Spanning Trees of Finite Graphs
- 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
- On two problems regarding the Hamiltonian cycle game
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- Playing to retain the advantage
- Random regular graphs of non-constant degree: concentration of the chromatic number
- Remarks on positional games. I
- The Game of JumbleG
- Tree embeddings
Cited in
(12)- Component games on regular graphs
- 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
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)
