The 42 reducts of the random ordered graph
classification
🧮 math.LO
math.CO
keywords
orderedgraphrandomlinearlyreductscountabledetermineembeds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.