540 research outputs found
Countable connected-homogeneous digraphs
A digraph is connected-homogeneous if every isomorphism between two finite
connected induced subdigraphs extends to an automorphism of the whole digraph.
In this paper, we completely classify the countable connected-homogeneous
digraphs.Comment: 49 page
Homogeneous 2-partite digraphs
We call a 2-partite digraph D homogeneous if every isomorphism between finite
induced subdigraphs that respects the 2-partition of D extends to an
automorphism of D that does the same. In this note, we classify the homogeneous
2-partite digraphs.Comment: 5 page
- …