THE 42 REDUCTS OF THE RANDOM ORDERED GRAPH
Manuel Bodirsky, Michael Pinsker · 2016
Abstract. The random ordered graph is the up to isomorphism unique countable homoge-neous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability. 1.