On big Ramsey degrees for binary free amalgamation classes

preprint2022arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.