7 research outputs found
Big Ramsey degrees using parameter spaces
We show that the universal homogeneous partial order has finite big Ramsey
degrees and discuss several corollaries. Our proof uses parameter spaces and
the Carlson-Simpson theorem rather than (a strengthening of) the
Halpern-L\"auchli theorem and the Milliken tree theorem, which are the primary
tools used to give bounds on big Ramsey degrees elsewhere (originating from
work of Laver and Milliken).
This new technique has many additional applications. To demonstrate this, we
show that the homogeneous universal triangle-free graph has finite big Ramsey
degrees, thus giving a short proof of a recent result of Dobrinen.Comment: 19 pages, 2 figure
The Ramsey Theory of Henson graphs
Analogues of Ramsey's Theorem for infinite structures such as the rationals
or the Rado graph have been known for some time. In this context, one looks for
optimal bounds, called degrees, for the number of colors in an isomorphic
substructure rather than one color, as that is often impossible. Such theorems
for Henson graphs however remained elusive, due to lack of techniques for
handling forbidden cliques. Building on the author's recent result for the
triangle-free Henson graph, we prove that for each , the
-clique-free Henson graph has finite big Ramsey degrees, the appropriate
analogue of Ramsey's Theorem.
We develop a method for coding copies of Henson graphs into a new class of
trees, called strong coding trees, and prove Ramsey theorems for these trees
which are applied to deduce finite big Ramsey degrees. The approach here
provides a general methodology opening further study of big Ramsey degrees for
ultrahomogeneous structures. The results have bearing on topological dynamics
via work of Kechris, Pestov, and Todorcevic and of Zucker.Comment: 75 pages. Substantial revisions in the presentation. Submitte
Exact big Ramsey degrees via coding trees
We characterize the big Ramsey degrees of free amalgamation classes in finite
binary languages defined by finitely many forbidden irreducible substructures,
thus refining the recent upper bounds given by Zucker. Using this
characterization, we show that the Fra\"iss\'e limit of each such class admits
a big Ramsey structure. Consequently, the automorphism group of each such
Fra\"iss\'e limit has a metrizable universal completion flow.Comment: Submitted versio