The 42 reducts of the random ordered graph
Logic
2017-05-17 v3 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1309.2165,
title = {The 42 reducts of the random ordered graph},
author = {Manuel Bodirsky and Michael Pinsker and András Pongrácz},
journal= {arXiv preprint arXiv:1309.2165},
year = {2017}
}
Comments
42 pages (!)