Fast strategies in Waiter-Client games
From MaRDI portal
Publication:2200433
DOI10.37236/9451zbMath1448.05141arXiv2003.09247OpenAlexW3104046156MaRDI QIDQ2200433
Publication date: 21 September 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.09247
Trees (05C05) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Waiter-client triangle-factor game on the edges of the complete graph ⋮ Waiter-client clique-factor game
Cites Work
- Doubly biased maker-breaker connectivity game
- Fast embedding of spanning trees in biased maker-breaker games
- On two problems regarding the Hamiltonian cycle game
- On chooser-picker positional games
- Hamiltonian circuits in random graphs
- On weight function methods in chooser-picker games
- How fast can maker win in fair biased games?
- Positional games
- Weak and strong \(k\)-connectivity games
- Fast winning strategies in maker-breaker games
- Pancyclic graphs. I
- On the threshold for the Maker-BreakerH-game
- Building Spanning Trees Quickly in Maker-Breaker Games
- Embedding Spanning Trees in Random Graphs
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Generating random graphs in biased Maker-Breaker games
- Biased Positional Games
- Fast strategies in biased Maker--Breaker games
- Positional games on random graphs
- Manipulative Waiters with Probabilistic Intuition
- Combinatorial Games
- A Solution of the Shannon Switching Game
- On a combinatorial game
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: Fast strategies in Waiter-Client games
