Some bounds for the Ramsey-Paris-Harrington numbers

DOI10.1016/0097-3165(81)90040-6zbMath0471.05045OpenAlexW2141157177MaRDI QIDQ1157345

George Mills

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90040-6

zbMATH Keywords

Ramsey-Paris-Harrington numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (11)

On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies ⋮ More on lower bounds for partitioning \(\alpha\)-large sets ⋮ A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies ⋮ Sharp thresholds for hypergraph regressive Ramsey numbers ⋮ Some rapidly growing functions ⋮ Upper bounds on positional Paris-Harrington games ⋮ Dickson's lemma and weak Ramsey theory ⋮ Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers ⋮ Regressive Ramsey numbers are Ackermannian ⋮ The varieties of arboreal experience ⋮ Ramsey-Paris-Harrington numbers for graphs

Cites Work

• Unnamed Item
• On Harrington's partition relation
• Rapidly growing Ramsey functions
• Graph Theory and Probability. II
• Some independence results for Peano arithmetic
• Some graph theoretic results associated with Ramsey's theorem

This page was built for publication: Some bounds for the Ramsey-Paris-Harrington numbers