Journal ArticleOPEN ACCESS

Regressive Ramsey Numbers Are Ackermannian

Journal of Combinatorial Theory. Series A (1999) 86(1) 177-181
DOI: 10.1006/jcta.1998.2906
6Citations
Citations of this article
75Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We give an elementary proof of the fact that regressive Ramsey numbers are Ackermannian. This fact was first proved by Kanamori and McAloon with mathematical logic techniques. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Kojman, M., & Shelah, S. (1999). Regressive Ramsey Numbers Are Ackermannian. Journal of Combinatorial Theory. Series A, 86(1), 177–181. https://doi.org/10.1006/jcta.1998.2906

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free