The structure of 𝑘-CS-transitive cycle-free partial orders

DOI10.1090/memo/0614zbMath0887.06001OpenAlexW4212994855MaRDI QIDQ4362215

Richard H. Warren

Publication date: 6 May 1998

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a74ccd9b93c486eaee6c1129521d694771c39f50

zbMATH Keywords

classificationtreehomogeneoustransitivecycle-free partial order

Mathematics Subject Classification ID

Partial orders, general (06A06) Infinite automorphism groups (20B27)

Related Items (10)

Countable locally 2-arc-transitive bipartite graphs ⋮ Unnamed Item ⋮ Countable, 1-transitive, coloured linear orderings. I. ⋮ Countable 1-Transitive Trees ⋮ The \(\aleph_{0}\)-categorical trees ⋮ Uncountable cofinalities of automorphism groups of linear and partial orders ⋮ Ranked highly-arc-transitive digraphs as colimits ⋮ Construction of some countable 1-arc-transitive bipartite graphs ⋮ \(k\)-CS-transitive infinite graphs ⋮ Construction of some uncountable 2-arc-transitive bipartite graphs

This page was built for publication: The structure of 𝑘-CS-transitive cycle-free partial orders