Manipulative Waiters with Probabilistic Intuition

DOI10.1017/S0963548315000310zbMath1378.91035arXiv1407.8391OpenAlexW2963951405MaRDI QIDQ5366922

Michael Krivelevich, Dan Hefetz, Tomasz Łuczak, Małgorzata Bednarska-Bzdȩga

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.8391

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Paths and cycles (05C38) Combinatorial games (91A46)

Related Items (10)

Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ On the odd cycle game and connected rules ⋮ Fast strategies in Waiter-Client games ⋮ Finding and Using Expanders in Locally Sparse 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 ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Picker-chooser fixed graph games
• The picker-chooser diameter game
• 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
• Expanding graphs contain all small trees
• Cycles in random graphs
• 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
• Biased positional games and the phase transition
• The phase transition in random graphs: A simple proof
• 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
• Remarks on positional games. I
• Regularity and Positional Games
• Biased Positional Games
• Paths in graphs
• Combinatorial Games
• A Solution of the Shannon Switching Game
• On a combinatorial game

This page was built for publication: Manipulative Waiters with Probabilistic Intuition