Online Ramsey Numbers and the Subgraph Query Problem

DOI10.1007/978-3-662-59204-5_4zbMath1444.91054arXiv1806.09726OpenAlexW2811269531MaRDI QIDQ3295265

Xiaoyu He, David Conlon, Jacob Fox, Andrey Grinshpun

Publication date: 8 July 2020

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberscombinatorial gamesonline Ramsey numbers

Mathematics Subject Classification ID

2-person games (91A05) Generalized Ramsey theory (05C55) Combinatorial games (91A46)

Related Items (6)

Bounds on Ramsey games via alterations ⋮ Restricted online Ramsey numbers of matchings and trees ⋮ Finding a planted clique by adaptive probing ⋮ A note on restricted online Ramsey numbers of matchings ⋮ Ramsey, Paper, Scissors ⋮ On the subgraph query problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• Lopsided Lovász Local lemma and Latin transversals
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on Ramsey numbers
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• The size Ramsey number
• Positional games
• Finding paths in sparse random graphs requires many queries
• Finding Hamilton cycles in random graphs with few queries
• On-line Ramsey Numbers
• Graph Theory and Probability. II
• Hypergraph Ramsey numbers
• Positional Games
• Ramsey Games Against a One-Armed Bandit
• Bounding Ramsey numbers through large deviation inequalities
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Two variants of the size Ramsey number
• Combinatorial Games
• Dynamic concentration of the triangle-free process

This page was built for publication: Online Ramsey Numbers and the Subgraph Query Problem