On finitary Hindman's numbers
classification
🧮 math.CO
keywords
answeraskedboundsfinitaryfolkman-sandersgivehindmannumbers
read the original abstract
Spencer asked whether the Paris-Harrington version of the Folkman-Sanders theorem has primitive recursive upper bounds. We give a positive answer to this question.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.