English

On big Ramsey degrees for binary free amalgamation classes

Logic 2022-07-12 v3 Combinatorics

Abstract

Generalizing and simplifying recent work of Dobrinen, we show that if L\mathcal{L} is a finite binary relational language and F\mathcal{F} is a finite set of finite irreducible L\mathcal{L}-structures, then the class K=Forb(F)\mathcal{K} = \mathrm{Forb}(\mathcal{F}) has finite big Ramsey degrees.

Keywords

Cite

@article{arxiv.2004.13162,
  title  = {On big Ramsey degrees for binary free amalgamation classes},
  author = {Andy Zucker},
  journal= {arXiv preprint arXiv:2004.13162},
  year   = {2022}
}

Comments

Formerly titled "A note on big Ramsey degrees." Accepted version

R2 v1 2026-06-23T15:08:16.091Z