10 papers
The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms
Manuel Bodirsky, Moritz Jahn, Simon Knäuer +2
Andréka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Hirsch and Cristiani showed that the ne…
Circular Chromatic Numbers, Balanceability, Relation Algebras, and Network Satisfaction Problems
Manuel Bodirsky, Santiago Guzmán-Pro, Moritz Jahn +2
In this paper, we characterize graphs with circular chromatic number less than 3 in terms of certain balancing labellings studied in the context of signed graphs. In fact, we const…
Twenty years of NeÅ¡etÅil's classification programme of Ramsey classes
Jan HubiÄka, MatÄj KoneÄný
In the 1970s, structural Ramsey theory emerged as a new branch of combinatorics. This development came with the isolation of the concepts of the -Ramsey property and Ra…
Forbidden cycles in metrically homogeneous graphs
Jan HubiÄka, Michael Kompatscher, MatÄj KoneÄný
In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space of finite diameter from Cherlin's catalogue of metrically homoge…
Ramsey expansions of metrically homogeneous graphs
Andrés Aranda, David Bradley-Williams, Jan HubiÄka +4
We investigate Ramsey expansions, the coherent extension property for partial isometries (EPPA), and the existence of a stationary independence relation for all classes of metrical…
Characterisation of the big Ramsey degrees of the generic partial order
Martin Balko, David Chodounský, Natasha Dobrinen +4
As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite p…