Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers

Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressive colorings have usual Ramsey numbers, that is, admit homogeneous, rather than just min-homogeneous sets.

Original languageEnglish
Pages (from-to)1036-1055
Number of pages20
JournalJournal of Combinatorial Theory. Series A
Volume115
Issue number6
DOIs
StatePublished - 1 Aug 2008

Keywords

  • Ackermannian functions
  • Kanamori-McAloon theorem
  • Paris-Harrington theorem
  • Rapidly growing Ramsey numbers

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers'. Together they form a unique fingerprint.

Cite this