Waiter-client and client-waiter Hamiltonicity games on random graphs
From MaRDI portal
Publication:2357219
DOI10.1016/j.ejc.2017.02.002zbMath1365.05198arXiv1509.05356OpenAlexW2964059120MaRDI QIDQ2357219
Wei En Tan, Dan Hefetz, Michael Krivelevich
Publication date: 19 June 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05356
Random graphs (graph-theoretic aspects) (05C80) 2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (7)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Client-waiter games on complete and random graphs ⋮ Waiter-client triangle-factor game on the edges of the complete graph ⋮ Waiter-client clique-factor game ⋮ Probabilistic intuition holds for a class of small subgraph games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Waiter-Client and Client-Waiter planarity, colorability and minor games
- Picker-chooser fixed graph games
- Small subgraphs in random graphs and the power of multiple choices
- Hamilton cycles in highly connected and expanding graphs
- The picker-chooser diameter game
- On two Hamilton cycle problems in random graphs
- Avoider-enforcer: the rules of the game
- Biased positional games and small hypergraphs with large covers
- On chooser-picker positional games
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- A solution to the Box Game
- Threshold functions
- Hamiltonian circuits in random graphs
- Positional games and the second moment method
- On weight function methods in chooser-picker games
- Avoider-Enforcer games
- Positional games
- Avoiding a giant component
- Hitting time results for Maker-Breaker games
- Introduction to Random Graphs
- Offline thresholds for Ramsey-type games on random graphs
- Hamiltonicity thresholds in Achlioptas processes
- A sharp threshold for the Hamilton cycle Maker–Breaker game
- Avoiding small subgraphs in Achlioptas processes
- Regularity and Positional Games
- Biased Positional Games
- Sharp thresholds of graph properties, and the $k$-sat problem
- Positional games on random graphs
- Paths in graphs
- Biased games on random boards
- Manipulative Waiters with Probabilistic Intuition
- Combinatorial Games
- A Solution of the Shannon Switching Game
- On a combinatorial game
This page was built for publication: Waiter-client and client-waiter Hamiltonicity games on random graphs
