On big Ramsey degrees for binary free amalgamation classes

From MaRDI portal



Abstract: Generalizing and simplifying recent work of Dobrinen, we show that if mathcalL is a finite binary relational language and mathcalF is a finite set of finite irreducible mathcalL-structures, then the class mathcalK=mathrmForb(mathcalF) has finite big Ramsey degrees.











This page was built for publication: On big Ramsey degrees for binary free amalgamation classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172222)