Regressive Ramsey numbers are Ackermannian
Menachem Kojman, Saharon Shelah
math.COarXiv:math/9805150
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.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell