A Dual Ramsey Theorem for Finite Ordered Oriented Graphs

Year, pages: 2019, 729 - 738

In contrast to the abundance of ``direct'' Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a meaningful dual Ramsey result. In this paper we prove a dual Ramsey theorem for finite ordered oriented graphs. Instead of embeddings, which are crucial for ``direct'' Ramsey results, we consider a special class of surjective homomorphisms between finite ordered oriented graphs. Since the setting we are interested in involves both structures and morphisms, all our results are spelled out using the reinterpretation of the (dual) Ramsey property in the language of category theory.

Mašulović, D., Pantić, B. 2019. A Dual Ramsey Theorem for Finite Ordered Oriented Graphs. In Mathematica Slovaca, vol. 69, no.4, pp. 729-738. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0264

Mašulović, D., Pantić, B. (2019). A Dual Ramsey Theorem for Finite Ordered Oriented Graphs. Mathematica Slovaca, 69(4), 729-738. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0264

Publisher: Mathematical Institute, Slovak Academy of Sciences, Bratislava