Claims

../

1991_02_01_erdos_galvin: Theorem 4.1 of Erdős and Galvin (Discrete Math. 1991): for every bound, a two-coloring under which no sequence with monochromatic finite sums meets the bound even once; the case k = 2, refereed.

2026_06_21_price: The June 2026 disproof that GPT Pro produced at Liam Price's prompting: for every f, a coloring of the integers under which every slowly growing sequence has subset sums of every color; accepted by the site after review.

---