29 citations · 30 across the 2 of their papers we have counts for
5 papers
Constraint satisfaction problems for reducts of homogeneous graphs
Manuel Bodirsky, Barnaby Martin, Michael Pinsker +1
For , let denote the -th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed t…
Projective clone homomorphisms
Manuel Bodirsky, Michael Pinsker, András Pongrácz
It is known that a countable -categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projection…
The universal homogeneous binary tree
Manuel Bodirsky, David Bradley-Williams, Michael Pinsker +1
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a un…
Reconstructing the topology of clones
Manuel Bodirsky, Michael Pinsker, András Pongrácz
Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the law…
A new operation on partially ordered sets
Péter Pál Pach, Michael Pinsker, András Pongrácz +1
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the firs…