A packed Ramsey’s theorem and computability theory

Abstract

Ramsey’s theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdős and Fred Galvin proved that for each coloring f f , there is an infinite set that is “packed together” which is given “a small number” of colors by f f .

We analyze the strength of this theorem from the perspective of computability theory and reverse mathematics. We show that this theorem is close in computational strength to the standard Ramsey’s theorem by giving arithmetical upper and lower bounds for solutions to computable instances. In reverse mathematics, we show that that this packed Ramsey’s theorem is equivalent to Ramsey’s theorem for exponents n ≠ 2 n\neq 2 . When n = 2 n=2 , we show that it implies Ramsey’s theorem and that it does not imply A C A 0 \mathsf {ACA}_0 .