2000 character limit reached
On big Ramsey degrees for binary free amalgamation classes (2004.13162v3)
Published 27 Apr 2020 in math.LO and math.CO
Abstract: Generalizing and simplifying recent work of Dobrinen, we show that if $\mathcal{L}$ is a finite binary relational language and $\mathcal{F}$ is a finite set of finite irreducible $\mathcal{L}$-structures, then the class $\mathcal{K} = \mathrm{Forb}(\mathcal{F})$ has finite big Ramsey degrees.