Andy Zucker
Published 2020-04-27Version 1
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.
The universal triangle-free graph has finite big Ramsey degrees
Fraïssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition
Dimension in T.T.T Structures
![QR code for arXiv:2004.13162 [math.LO]](http://oss.arxitics.com/images/favicon.svg)