Countable 1-Transitive Trees

DOI10.1007/978-3-319-51718-6_11zbMath1436.06002OpenAlexW2621137221MaRDI QIDQ3298254

Katie Chicot, John K. Truss

Publication date: 14 July 2020

Published in: Groups, Modules, and Model Theory - Surveys and Recent Developments (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51718-6_11

zbMATH Keywords

treeconeramification point1-transitivecoding treelower semilinear order

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Combinatorics of partially ordered sets (06A07)

Related Items (1)

Classification of \(\aleph_0\)-categorical \(C\)-minimal pure \(C\)-sets

Cites Work

• Unnamed Item
• A classification of countable lower 1-transitive linear orders
• Countable, 1-transitive, coloured linear orderings. I.
• A class of relation types isomorphic to the ordinals
• Constraint Satisfaction with Countable Homogeneous Templates
• Structure of partially ordered sets with transitive automorphism groups
• Automorphism Groups of Infinite Semilinear Orders (I)
• The lattice of varieties of representable relation algebras
• The structure of 𝑘-CS-transitive cycle-free partial orders
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Relations related to betweenness: their structure and automorphisms
• Countable 1-transitive coloured linear orderings II
• The universal homogeneous binary tree

This page was built for publication: Countable 1-Transitive Trees