The Erdős-Rado number is the least
such that every oriented graph
on
vertices has an independent
vertex set of size
or a transitive tournament
on
vertices. The problem of determining these numbers is
problem 112 in Bloom's (2026) collection. Ihringer et al. (2021) proved
for
.
Orden (2026a) reports , improving
the earlier range from 29 to 33. The lower bound uses an explicit 29-vertex oriented
graph avoiding both required structures. Claude agents helped find the witness
and develop the upper-bound argument and Lean formalization. The author reports that
Lean, Nanoda, and con-ron checked the formal proof. The preprint remains unrefereed.
Orden (2026b) also reports ,
,
, and
. Each lower bound is witnessed by an explicit
oriented graph on one fewer vertex. Claude agents
found the witnesses and wrote the formalization. The author reports Lean kernel checks
of all four witnesses. These bounds leave the exact values open.