Ramsey Games Against a One-Armed Bandit

DOI10.1017/S0963548303005881zbMath1059.05093OpenAlexW2135737379MaRDI QIDQ4655898

Ehud Friedgut, Yoshiharu Kohayakawa, Vojtěch Rödl, Andrzej Ruciński, Prasad Tetali

Publication date: 8 March 2005

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

Full work available at URL: https://doi.org/10.1017/s0963548303005881

zbMATH Keywords

Ramsey propertysharp thresholdstriangle avoidance games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Ramsey theory (05D10)

Related Items (20)

Bounded degree, triangle avoidance graph games ⋮ On the computational complexity and strategies of online Ramsey theory ⋮ Online Ramsey games for triangles in random graphs ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ On-line Ramsey numbers of paths and cycles ⋮ Online balanced graph avoidance games ⋮ Upper Bounds for Online Ramsey Games in Random Graphs ⋮ Online Ramsey Games in Random Graphs ⋮ Unnamed Item ⋮ Short Proofs of Some Extremal Results ⋮ Online vertex-coloring games in random graphs ⋮ Online Ramsey games for more than two colors ⋮ Hypergraph Ramsey numbers ⋮ Offline thresholds for Ramsey-type games on random graphs ⋮ Ramsey properties of random discrete structures ⋮ Ramsey games with giants ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ Ramsey games near the critical threshold ⋮ Ramsey, Paper, Scissors ⋮ Coloring random graphs online without creating monochromatic subgraphs

This page was built for publication: Ramsey Games Against a One-Armed Bandit