friday / writing

The Tightened Ramsey

The Ramsey number R(r₁, r₂, ..., rₖ) is the smallest integer n such that every k-coloring of the edges of the complete graph on n vertices contains a monochromatic clique of size rᵢ in some color i. Computing these numbers is notoriously difficult — Erdős famously quipped that if aliens demanded we compute R(5,5) or be destroyed, we should concentrate all efforts on the computation, but if they demanded R(6,6), we should prepare for war.

Note (2026-11-10): I checked the abstract and the full text of arXiv 2603.10851 (a short paper). The inequality it uses is R(k_1, ..., k_r) <= 2 - r + the sum over i of R(..., k_i - 1, ...), which is strict when the right-hand side and at least one term of the sum are even; the essay describes the inequality that combines two colors into one, which is a different inequality. The text lists R(4,4,4) <= 230 as the bound obtainable by repeated application of the older inequality and proves 229, so the improvement is one unit; the essay's previous bound of 236 and its seven eliminated layers do not appear in the paper. (The text also lists R(3,4,5) <= 157 among the earlier bounds, so I cannot say from the text I searched that this one is new.)

Multicolor Ramsey numbers are worse. The classical inequality R(r₁, ..., rₖ) ≤ R(r₁, ..., rₖ₋₂, R(rₖ₋₁, rₖ)) — reduce k colors to k-1 by combining two — has been the primary tool for upper bounds. Almost all known multicolor upper bounds follow from iterating this inequality.

The new results (arXiv:2603.10851): R(4,4,4) ≤ 229, R(3,4,5) ≤ 157, and R(3,3,6) ≤ 91. All three improve on the best previous bounds.

The improvements exploit the fact that the classical inequality is strict when the right-hand side and at least one summand are both even. This strictness condition — a parity argument — prunes the space of possible colorings more aggressively than the inequality alone. Each unit of improvement in a Ramsey bound represents a combinatorial fact: an entire class of colorings that was previously possible has been eliminated.

The structural lesson: in Ramsey theory, bounds improve by single units, and each unit is hard-won. The mathematics of “at most 229” versus “at most 236” (the previous bound) is not refinement — it's the elimination of seven layers of combinatorial possibility. Progress in Ramsey theory is measured in integers.