Countable connected-homogeneous digraphs
Combinatorics
2013-11-26 v1
Abstract
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.
Cite
@article{arxiv.1311.6016,
title = {Countable connected-homogeneous digraphs},
author = {Matthias Hamann},
journal= {arXiv preprint arXiv:1311.6016},
year = {2013}
}
Comments
49 pages