Structure of partially ordered sets with transitive automorphism groups
From MaRDI portal
Recommendations
- Partially Ordered Sets with Transitive Automorphism Groups
- Automorphism Groups of Homogeneous Semilinear Orders: Normal Subgroups and Commutators
- Elementary properties of cycle-free partial orders and their automorphism groups
- Sharply transitive partially ordered sets
- A construction of all normal subgroup lattices of 2-transitive automorphism groups of linearly ordered sets
Cited in
(47)- Construction of some uncountable 2-arc-transitive bipartite graphs
- Sharply transitive partially ordered sets
- Complete embeddings of linear orderings and embeddings of lattice-ordered groups
- Transitive primitive permutation groups acting on trees
- The ubiquity of free groups
- Strongly determined types
- Cell decompositions of C-minimal structures
- Automorphism groups of countable highly homogeneous partially ordered sets
- Homogeneous bands
- Partially homogeneous partially ordered sets
- On \(c\)-3-transitive automorphism groups of cyclically ordered sets.
- On variants of o-minimality
- \(\aleph_0\)-categoricity of semigroups. II.
- Homogeneous actions on the random graph
- A survey of homogeneous structures
- On k-homogeneous posets and graphs
- \(\aleph _0\)-categoricity of semigroups
- Orbit-equivalent infinite permutation groups.
- Countable locally 2-arc-transitive bipartite graphs
- Semi-Ohkuma chains
- Countable 1-transitive trees
- scientific article; zbMATH DE number 4158683 (Why is no real title available?)
- Partially Ordered Sets with Transitive Automorphism Groups
- scientific article; zbMATH DE number 4079484 (Why is no real title available?)
- Representation of Tree Permutations by Words
- Commutators in groups of order-preserving permutations
- Automorphism Groups of Homogeneous Semilinear Orders: Normal Subgroups and Commutators
- scientific article; zbMATH DE number 91041 (Why is no real title available?)
- Set-homogeneous directed graphs
- Structural properties of dendrite groups
- Betweenness relations and cycle-free partial orders
- Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees
- Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals
- The \(\aleph_{0}\)-categorical trees
- Constraint Satisfaction Problems with Infinite Templates
- On a quotient \(S\)-set induced by countably infinite decreasing chains
- Weakly binary expansions of dense meet‐trees
- On limits of betweenness relations
- Set‐homogeneous hypergraphs
- scientific article; zbMATH DE number 7795665 (Why is no real title available?)
- Simplicity of some automorphism groups.
- Dedekind-finite cardinals having countable partitions
- Homomorphism-homogeneous normal bands
- A classification of countable lower 1-transitive linear orders
- Homomorphism-homogeneous finite semilattices
- Some more notions of homomorphism-homogeneity
- Construction of some countable 1-arc-transitive bipartite graphs
This page was built for publication: Structure of partially ordered sets with transitive automorphism groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691714)