Constraint satisfaction problems for reducts of homogeneous graphs

Manuel Bodirsky, Barnaby Martin, Michael Pinsker +1

For $n\ge 3$, let $(H_n,E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed t…