72 citations · 368 across the 79 of their papers we have counts for
11 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…
The Generic Circular Triangle-Free Graph
Manuel Bodirsky, Santiago Guzmán-Pro
In this paper, we introduce the generic circular triangle-free graph and propose a finite axiomatization of its first order theory. In particular, our main results sh…
Forbidden Tournaments and the Orientation Completion Problem
Manuel Bodirsky, Santiago Guzmán-Pro
For a fixed finite set of finite tournaments , the -free orientation problem asks whether a given finite undirected graph has an -free o…
Asymptotic Theories of Classes Defined by Forbidden Homomorphisms
Manuel Bodirsky, Colin Jahel
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set of finite structures. If $\mathc…
Maximal Digraphs With Respect to Primitive Positive Constructibility
Florian Starke, Manuel Bodirsky
We study the class of all finite directed graphs up to primitive positive constructability. The resulting order has a unique greatest element, namely the graph with one verte…
Canonical Functions: a proof via topological dynamics
Manuel Bodirsky, Michael Pinsker
Canonical functions are a powerful concept with numerous applications in the study of groups, monoids, and clones on countable structures with Ramsey-type properties. In this short…