  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.

Logic;Combinatorics