Fast embedding of spanning trees in biased maker-breaker games
From MaRDI portal
Publication:427795
DOI10.1016/J.EJC.2012.01.007zbMATH Open1242.05179OpenAlexW2088725657MaRDI QIDQ427795FDOQ427795
Authors: Asaf Ferber, Dan Hefetz, Michael Krivelevich 
Publication date: 18 June 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.01.007
Recommendations
Cites Work
- Title not available (Why is that?)
- Tree embeddings
- Embedding nearly-spanning bounded degree trees
- Expanding graphs contain all small trees
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Remarks on positional games. I
- Biased Positional Games
- Combinatorial Games
- On two problems regarding the Hamiltonian cycle game
- Fast winning strategies in maker-breaker games
- Embedding spanning trees in random graphs
- Deterministic Graph Games and a Probabilistic Intuition
- Hamilton cycles in highly connected and expanding graphs
- A solution to the Box Game
- Sharp threshold for the appearance of certain spanning trees in random graphs
- On Biased Positional Games
- Expanders Are Universal for the Class of All Spanning Trees
Cited In (7)
- Building spanning trees quickly in maker-breaker games
- Winning fast in biased maker-breaker games
- Fast strategies in Waiter-Client games
- Waiter-client triangle-factor game on the edges of the complete graph
- Fast strategies in maker-breaker games played on random boards
- Generating random graphs in biased maker-breaker games
- Weak and strong \(k\)-connectivity 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)
