The 42 reducts of the random ordered graph
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
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.
Details
| Original language | English |
|---|---|
| Pages (from-to) | 591-632 |
| Number of pages | 42 |
| Journal | Proceedings of the London Mathematical Society |
| Volume | 111 |
| Issue number | 3 |
| Publication status | Published - 29 May 2014 |
| Peer-reviewed | Yes |
External IDs
| ORCID | /0000-0001-8228-3611/work/142241115 |
|---|