Sharp thresholds for hypergraph regressive Ramsey numbers

DOI10.1016/J.JCTA.2010.08.004zbMath1251.05103OpenAlexW1988940169MaRDI QIDQ618311

Lorenzo Carlucci, Andreas Weiermann, Gyesik Lee

Publication date: 14 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.08.004

zbMATH Keywords

independence resultsregressive Ramsey numbers, rapidly growing regressive Ramsey functions

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (7)

Phase transition results for three Ramsey-like theorems ⋮ Unnamed Item ⋮ THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS ⋮ Combinatorial unprovability proofs and their model-theoretic counterparts ⋮ Dickson's lemma and weak Ramsey theory ⋮ Regressive functions on pairs ⋮ Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension

Cites Work

• Unnamed Item
• Unnamed Item
• On Gödel incompleteness and finite combinatorics
• Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
• Combinatorial set theory: Partition relations for cardinals
• Some bounds for the Ramsey-Paris-Harrington numbers
• Rapidly growing Ramsey functions
• Regressive Ramsey numbers are Ackermannian
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• A classification of rapidly growing Ramsey functions
• An application of graphical enumeration to PA *
• A classification of the ordinal recursive functions
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Combinatorial Theorems on Classifications of Subsets of a Given Set

This page was built for publication: Sharp thresholds for hypergraph regressive Ramsey numbers