Countable 1-transitive trees
From MaRDI portal
Recommendations
Cites work
- A class of relation types isomorphic to the ordinals
- A classification of countable lower 1-transitive linear orders
- Automorphism Groups of Infinite Semilinear Orders (I)
- Constraint Satisfaction with Countable Homogeneous Templates
- Countable 1-transitive coloured linear orderings II
- Countable homogeneous and partially homogeneous ordered structures
- Countable, 1-transitive, coloured linear orderings. I.
- Relations related to betweenness: their structure and automorphisms
- Structure of partially ordered sets with transitive automorphism groups
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- The lattice of varieties of representable relation algebras
- The structure of 𝑘-CS-transitive cycle-free partial orders
- The universal homogeneous binary tree
Cited in
(3)
This page was built for publication: Countable 1-transitive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298254)