Set-homogeneous directed graphs
From MaRDI portal
Abstract: A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite set-homogeneous digraphs, where we allow some pairs of vertices to have arcs in both directions. Under the assumption that such pairs of vertices are not allowed, we obtain initial results on countably infinite set-homogeneous digraphs, classifying those which are not 2-homogeneous.
Recommendations
Cites work
- A finite presentation of the rational Urysohn space
- Antipodal distance transitive covers of complete graphs
- Combinatorially homogeneous graphs
- Countable homogeneous partially ordered sets
- Countable Homogeneous Tournaments
- Countable Ultrahomogeneous Undirected Graphs
- Cycle types in infinite permutation groups
- Finite presentation of homogeneous graphs, posets and Ramsey classes
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Homogeneous graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3819758 (Why is no real title available?)
- scientific article; zbMATH DE number 3730191 (Why is no real title available?)
- scientific article; zbMATH DE number 44603 (Why is no real title available?)
- scientific article; zbMATH DE number 2152953 (Why is no real title available?)
- scientific article; zbMATH DE number 3080680 (Why is no real title available?)
- Infinite homogeneous bipartite graphs with unequal sides
- Notes on infinite permutation groups
- On Homogeneous Graphs
- Permutation Groups with Multiply Transitive Suborbits
- Set-homogeneous graphs
- SOME TREELIKE OBJECTS
- Structure of partially ordered sets with transitive automorphism groups
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- The Urysohn sphere is oscillation stable
- Theory of relations. Transl. from the French by P. Clote
- Transitivity of finite permutation groups on unordered sets
- Transitivity of permutation groups on unordered sets
Cited in
(14)- Set-homogeneous graphs
- Compactness and finite equivalence of infinite digraphs
- The classification of finite and locally finite connected-homogeneous digraphs
- Locally-finite connected-homogeneous digraphs
- A survey of homogeneous structures
- Orbit-equivalent infinite permutation groups.
- Homogeneous 2-partite digraphs
- scientific article; zbMATH DE number 4010503 (Why is no real title available?)
- scientific article; zbMATH DE number 91055 (Why is no real title available?)
- scientific article; zbMATH DE number 887760 (Why is no real title available?)
- Homogeneous structures -- a list of open problems
- Characterizing homogenous digraphs
- Set‐homogeneous hypergraphs
- Classification of some countable descendant-homogeneous digraphs
This page was built for publication: Set-homogeneous directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412175)