17 citations · 78 across the 27 of their papers we have counts for
6 papers · 1 filter
Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems
Manuel Bodirsky, Santiago Guzmán-Pro, Moritz Jahn +2
In this paper, we characterize finite graphs with circular chromatic number less than 3 in terms of the existence of certain signings (-labellings studied in the conte…
Network Satisfaction over Four-Atom Relation Algebras: Complexity and Representations
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. Cristani and Hirsch showed that the netw…
Counting big Ramsey degrees of the homogeneous and universal -free graph
Jan Hubička, Matěj Konečný, Štěpán Vodseďálek +1
Big Ramsey degrees of Fraïssé limits of finitely constrained free amalgamation classes in finite binary languages have been recently fully characterised by Balko, Chodounský, Dobri…
On Big Ramsey degrees of universal -edge-labeled hypergraphs
Jan Hubička, Matěj Konečný, Stevo Todorcevic +1
We show that the big Ramsey degrees of every countable universal -uniform -edge-labeled hypergraph are infinite for every . Together with a recent result of Braunfel…
Oscillating subalgebras of the atomless countable Boolean algebra
Dana Bartošová, David Chodounský, Barbara Csima +6
We show that the big Ramsey degree of the Boolean algebra with 3 atoms within the countable atomless Boolean algebra is infinite.
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…