Fast embedding of spanning trees in biased maker-breaker games
From MaRDI portal
Publication:427795
Recommendations
Cites work
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- A solution to the Box Game
- Asymptotic random graph intuition for the biased connectivity game
- Biased Positional Games
- Combinatorial Games
- Deterministic Graph Games and a Probabilistic Intuition
- Embedding nearly-spanning bounded degree trees
- Embedding spanning trees in random graphs
- Expanders Are Universal for the Class of All Spanning Trees
- Expanding graphs contain all small trees
- Fast winning strategies in maker-breaker games
- Hamilton cycles in highly connected and expanding graphs
- On Biased Positional Games
- On two problems regarding the Hamiltonian cycle game
- Remarks on positional games. I
- Sharp threshold for the appearance of certain spanning trees in random graphs
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Tree embeddings
Cited in
(8)- Fast embedding of spanning trees in biased maker-breaker games
- Weak and strong \(k\)-connectivity games
- Waiter-client triangle-factor game on the edges of the complete graph
- Fast strategies in maker-breaker games played on random boards
- Building spanning trees quickly in maker-breaker games
- Generating random graphs in biased maker-breaker games
- Winning fast in biased maker-breaker games
- Fast strategies in Waiter-Client games
This page was built for publication: Fast embedding of spanning trees in biased maker-breaker games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427795)
