English

Fraisse classes with simply characterized big Ramsey degrees

Combinatorics 2021-09-14 v4 Logic

Abstract

We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees which have a simple characterization. It follows that any such Fraisse structure admits a big Ramsey structure. Furthermore, we prove indivisibility for every Fraisse structure in an arbitrary finite relational language satisfying this property. This work offers a streamlined and unifying approach to Ramsey theory on some seemingly disparate classes of Fraisse structures. Novelties include a new formulation of coding trees in terms of 1-types over initial segments of the Fraisse structure, and a direct characterization of the degrees without appeal to the standard method of "envelopes".

Keywords

Cite

@article{arxiv.2010.02034,
  title  = {Fraisse classes with simply characterized big Ramsey degrees},
  author = {Rebecca Coulson and Natasha Dobrinen and Rehana Patel},
  journal= {arXiv preprint arXiv:2010.02034},
  year   = {2021}
}

Comments

The error in version 1 has been corrected. Submitted. 69 pages

R2 v1 2026-06-23T19:02:47.813Z