paper

Conjugacy for homogeneous ordered graphs

arXiv:1804.04609 · doi:10.1007/s00153-018-0645-0

Abstract

We show that for any countable homogeneous ordered graph , the conjugacy problem for automorphisms of is Borel complete. In fact we establish that each such satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of is Borel reducible to the conjugacy relation on automorphisms of .

Conjugacy for homogeneous ordered graphs · wovepaper