The Maker--Breaker Rado Game on a Random Set of Integers
From MaRDI portal
Publication:4646256
DOI10.1137/18M117488XzbMath1419.91116arXiv1803.03793OpenAlexW2963928044WikidataQ128607577 ScholiaQ128607577MaRDI QIDQ4646256
Publication date: 11 January 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03793
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
An asymmetric random Rado theorem for single equations: The 0‐statement ⋮ Maker-breaker resolving game
Cites Work
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- Van der Waerden and Ramsey type games
- Threshold functions
- A removal lemma for systems of linear equations over finite fields
- Studien zur Kombinatorik
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- Positional games
- On the threshold for the Maker-BreakerH-game
- Ramsey properties of random discrete structures
- Random graphs with monochromatic triangles in every edge coloring
- Rado Partition Theorem for Random Subsets of Integers
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
- Positional games on random graphs
- Threshold Functions for Ramsey Properties
- On the optimality of the uniform random strategy
- Independent sets in hypergraphs
- Combinatorial Games
- On a combinatorial game
- Biased positional games for which random strategies are nearly optimal
