Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 621

Preprint Number 621

Previous Next Preprint server

621. Manuel Bodirsky, Michael Pinsker, András Pongrácz
The 42 reducts of the random ordered graph

Submission date: 9September 2013.


The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 1309.2165: pdf, ps.

Last updated: September 11 2013 14:13 Please send your corrections to: