Problem #181 asks to prove $R(Q_n) \ll 2^n$, where $Q_n$ is the $n$-dimensional hypercube graph.
The associated integer sequence is $R(Q_2), R(Q_3), R(Q_4), \ldots$ — the diagonal Ramsey numbers of the hypercube graphs. Known values are sparse (only the smallest cases are known exactly), and a focused computational effort could surface either an OEIS match or a new sequence with even a few terms.
Comparable sequence: A389313 handles cycle Ramsey $r(C_n, C_n)$; $R(Q_2) = r(C_4, C_4) = 6$ via that sequence. But for $n \geq 3$ no OEIS sequence appears to track $R(Q_n)$ specifically.
(Filed alongside PRs #283, #284, #285, #286, #287, #288, #289 in a Tier-1 OEIS-linking pass.)
Problem #181 asks to prove$R(Q_n) \ll 2^n$ , where $Q_n$ is the $n$ -dimensional hypercube graph.
The associated integer sequence is$R(Q_2), R(Q_3), R(Q_4), \ldots$ — the diagonal Ramsey numbers of the hypercube graphs. Known values are sparse (only the smallest cases are known exactly), and a focused computational effort could surface either an OEIS match or a new sequence with even a few terms.
Comparable sequence: A389313 handles cycle Ramsey$r(C_n, C_n)$ ; $R(Q_2) = r(C_4, C_4) = 6$ via that sequence. But for $n \geq 3$ no OEIS sequence appears to track $R(Q_n)$ specifically.
(Filed alongside PRs #283, #284, #285, #286, #287, #288, #289 in a Tier-1 OEIS-linking pass.)