---
title: Online Ramsey Number Overview
url: https://www.emergentmind.com/topics/online-ramsey-number
type: topic
---

# Online Ramsey Number Overview

The online Ramsey number is a central invariant of a two-player sequential coloring game on a host graph (frequently the infinite clique $K_\mathbb{N}$), played between Builder and Painter. In each round, Builder selects a previously unexposed edge; Painter immediately assigns a color (typically red or blue, but sometimes more) to that edge. Builder's objective is to force the appearance of a monochromatic copy of a target graph $H$ (or, in the general two-graph setting, to force a red copy of $G_1$ or a blue copy of $G_2$) as rapidly as possible, while Painter tries to delay this outcome. The online Ramsey number, denoted $\tilde{r}(G_1,G_2)$, is the minimal number of rounds required for Builder to guarantee victory under optimal adversarial painter response.

## 1. Formal Definition and Game Variants

The standard online Ramsey game is played on an infinite vertex set, where every round consists of:
- Builder selecting an unused edge,
- Painter coloring the edge red or blue.

The online Ramsey number is then 
\[
\tilde{r}(G_1, G_2) = \min \left\{ N : \text{Builder has a strategy to force a red } G_1 \text{ or a blue } G_2 \text{ within } N \text{ moves} \right\}
\]
with $G_1,G_2$ fixed target graphs [2302.13640].

Variants include restricted online Ramsey numbers, played on a finite host graph of $N$ vertices (with all edges initially uncolored), and ordered online Ramsey games, where the vertex set is equipped with a linear order and monochromatic subgraphs must preserve this order [2010.04113, 1812.04131, 2409.01917].

A further extension is the online Ramsey turnaround game, where in each round Builder may forbid one color on the exposed edge, Painter picks from the remaining colors, and the game's objective is reversed: Painter aims to *force* a monochromatic copy of the target $H$ as quickly as possible [2512.08053].

## 2. Relationship to Classical Ramsey and Size Ramsey Numbers

The online Ramsey number interpolates between the vertex Ramsey number $r(G_1, G_2)$ and the size Ramsey number $\hat r(G_1,G_2)$:
\[
\tilde{r}(G_1,G_2) \leq \hat r(G_1,G_2) \leq \binom{r(G_1,G_2)}{2}
\]
[2302.13640]. 
All Builder strategies in the online Ramsey number setting can be viewed as sequential constructions of host graphs with the Ramsey property; optimal strategies often exploit forced responses to accelerate the appearance of $H$, yielding superlinear savings over brute-force constructions [1812.04131].

## 3. Key Results and Asymptotic Estimates

### Off-diagonal Path-Path Online Ramsey Numbers

Recent research has determined:
- For $k = o(n)$ and $n \to \infty$,
\[
\tilde{r}(P_k, P_n) = (5/3 + o(1)) n
\]
with exact lower and upper bounds proven [2312.16628, 2504.14926, 2310.09377]. Prior conjectures positing a $3/2$ factor are disproven for $k\ge 10$.

- For $P_4$ vs $P_n$,
\[
\tilde{r}(P_4, P_n) = \left\lceil \frac{7n}{5} \right\rceil - 1 \quad \forall n\ge 10
\]
[2302.13640, 2310.09377].

### Cycle-Cycle and Path-Cycle Online Ramsey Numbers

- For cycles $C_k$ (even $k$) vs long cycles $C_n$, the tight bound is:
\[
\tilde{r}(C_k, C_n) = 2n + \Theta(k)
\]
[2303.15194].

- For the claw $K_{1,3}$ vs cycles:
\[
\tilde{r}(K_{1,3}, C_{\ell}) = \left\lfloor \frac{3(\ell+1)}{2} \right\rfloor \quad \ell \geq 13
\]
[2601.05452].

- For $C_4$ vs paths, the threshold is:
\[
\tilde{r}(C_4, P_n) = 2n-2 \quad n\ge 8
\]
[2211.12204]. Exact value for $P_6$ is determined as $11$ [2305.04305].

### Diagonal Clique Online Ramsey Numbers

Sharp lower bounds have been obtained:
\[
\tilde{r}(n,n) \geq 2^{(2-\sqrt{2})n + O(1)}
\]
for large $n$, via random Painter strategies and weight-function arguments [1806.09726]. Similarly, off-diagonal:
\[
\tilde{r}(m,n) \geq n^{(2-\sqrt{2})m + O(1)}
\]
for fixed $m\geq 3$.

## 4. Optimal Strategies and Methodology

### Builder Strategies

Builder exploits forced Painter moves by targeting edges which, if colored improperly, immediately complete the target graph. Inductive constructions, path- and cycle-extensions, and template-based case analyses dominate strategy design. For $P_4$-vs-path, a three-stage strategy seeds "structural units," extends them into gadgets with prescribed monochromatic subpaths, and finally connects them into the desired path—all steps orchestrated to restrict Painter's freedom and extract forced blue extensions [2302.13640, 2310.09377].

For cycles, path-building methods shift to "cycle-shortening" lemmas, and for more complex pairs such as $(K_{1,3}, C_\ell)$, Builder repeatedly forces small configurations (roots, gadgets, wavy paths) until the closure lemma applies [2601.05452].

### Painter Strategies

Optimal Painter play consists of deferred creation of forbidden structures, coloring red unless a red copy of $G_1$ or closed red cycle would emerge, and blue otherwise. Defensive coloring exploits local degrees, forced star or matching avoidance, and for ordered games, left/right degree balance [2409.01917, 2211.12204].

Potential-function methods are used to quantify the growth of blue and red subgraphs, yielding tight lower bounds on total rounds by tracking parameters such as degree-1 vertices or component structure [2504.14926, 2312.16628].

## 5. Restricted, Ordered, Induced, and Turnaround Online Ramsey Numbers

### Restricted Online Ramsey Numbers

For a finite host of $N$ vertices,
\[
\tilde{R}_2(rK_2; 3r-1) = 3r-2, \quad \tilde{R}_3(rK_2; 4r-2) = 5r-4
\]
with matching upper/lower bounds achieved through refined edge-typing and matching-packing arguments [2010.04113].

### Ordered Online Ramsey Numbers

In ordered settings, the online ordered Ramsey number is controlled by the interval-chromatic number and left/right degrees. Tight bounds have been established:
\[
r_o(G, P_n) = O(n \log n)
\]
for arbitrary ordered $G$ [2210.05235]; $O(n)$ for $3$-ichromatic $G$. Lower bounds are governed by maximal degrees:
\[
r_o(G_1, G_2) \geq \frac{1}{4} \min\{\Delta^-(G_1)(\Delta^-(G_1)-1), \Delta^+(G_2)(\Delta^+(G_2)-1)\}
\]
[2409.01917].

### Induced Online Ramsey Numbers

The induced variant $\widetilde{r}_{\mathrm{ind}}(H)$ requires Builder to force an induced monochromatic $H$. For paths and cycles, linear-in-$n$ bounds are proven:
\[
\widetilde{r}_{\mathrm{ind}}(P_n) \leq 28n -27, \quad \widetilde{r}_{\mathrm{ind}}(C_n) = O(n)
\]
[1901.03671]. Notably, for thorn-regular caterpillars $S_{k,\ell}$, one has
\[
\widetilde{r}_{\mathrm{ind}}(S_{k,\ell}) = O(k)
\]
independent of $\ell$, establishing a gap phenomenon relative to induced size-Ramsey numbers.

### Turnaround Numbers

In the 3-color turnaround game, Painter forces a monochromatic $H$ while Builder restricts one color per edge. General bounds are:
\[
\xi(H) + 1 \leq f(H) \leq R(H)
\]
with $\xi(H)$ the polychromatic extremal function [2512.08053]. Asymptotics reveal a density threshold controlled by the chromatic number and polychromatic colorings.

## 6. Connections to Other Invariants and Open Problems

Online Ramsey numbers interlink with Turán numbers, polychromatic Ramsey theory, and set-coloring Ramsey numbers. Set-coloring thresholds, chromatic-Ramsey numbers, and generalized polychromatic functions appear throughout as bounding tools [2512.08053]. For paths, the exact linear constant for $\tilde{r}(P_k,P_n)/n$ is resolved for $k\ge 10$, with $k=5,\dots,9$ remaining open [2504.14926, 2312.16628].

For ordered online Ramsey, the gap between $O(n \log n)$ and $\Omega(n\log n)$ in path-path games is a major open question; for cycles, constant-factor improvements in the odd case remain conjectural [2409.01917, 2210.05235].

In the restricted game, saving $\Omega(N\log N)$ moves over the naive bound $\binom{N}{2}$ is now possible for the diagonal case; the off-diagonal threshold is conjectured to admit constant fraction savings [1812.04131].

Gap phenomena between online, induced online, and size-Ramsey numbers continue to guide research into the efficiency of sequential graph-building under adversarial coloring [1901.03671].

Source: https://www.emergentmind.com/topics/online-ramsey-number