Picker-chooser fixed graph games
From MaRDI portal
Publication:273174
DOI10.1016/j.jctb.2015.12.008zbMath1334.05086arXiv1402.7308OpenAlexW2227260335MaRDI QIDQ273174
Dan Hefetz, Małgorzata Bednarska-Bzdȩga, Tomasz Łuczak
Publication date: 21 April 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.7308
random graphsthreshold functionpositional gamesTalagrand's inequalitycounting subgraphsprobabilistic intuition
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (10)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ Sharp thresholds for half-random games I ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ On the odd cycle game and connected rules ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ Client-waiter games on complete and random graphs ⋮ Waiter-client clique-factor game ⋮ Probabilistic intuition holds for a class of small subgraph games ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
Cites Work
- Unnamed Item
- Small subgraphs in random graphs and the power of multiple choices
- Avoider-enforcer: the rules of the game
- On chooser-picker positional games
- When are small subgraphs of a random graph normally distributed?
- Positional games and the second moment method
- Concentration of measure and isoperimetric inequalities in product spaces
- On weight function methods in chooser-picker games
- Avoider-Enforcer games
- Offline thresholds for Ramsey-type games on random graphs
- Avoiding small subgraphs in Achlioptas processes
- Remarks on positional games. I
- Threshold functions for small subgraphs
- Combinatorial Games
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: Picker-chooser fixed graph games
