Big Ramsey degrees using parameter spaces
arXiv:2009.00967 · doi:10.1016/j.aim.2025.110386
Abstract
We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the Halpern-Läuchli theorem and the Milliken tree theorem, which are typically used to bound big Ramsey degrees in the existing literature (originating from the work of Laver and Milliken). This new technique has many additional applications. We show that the homogeneous universal triangle-free graph has finite big Ramsey degrees, providing a short proof of a recent result by Dobrinen. Moreover, generalizing an indivisibility (vertex partition) result of Nguyen van Thé and Sauer, we give an upper bound on big Ramsey degrees of metric spaces with finitely many distances. This leads to a new combinatorial argument for the oscillation stability of the Urysohn Sphere.
arXiv comment33 pages, 2 figures; very minor revision fixing a few typos
References in corpus (8)
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Some examples of universal and generic partial orders
- The Ramsey theory of the universal homogeneous triangle-free graph
- Colouring homogeneous structures
- Big Ramsey degrees of 3-uniform hypergraphs
- Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
- Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
- Big Ramsey Degrees and Infinite Languages