Countable connected-homogeneous digraphs

2013/11/23 by Matthias Hamann, Hamann, Matthias
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #math.CO #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1311.6016

49 pages

arxiv created 2013/11/23 · openalex publication_date 2013/11/23 · arxiv updated 2013/11/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• The classification of finite and locally finite connected-homogeneous digraphs
• Locally-finite connected-homogeneous digraphs
• Set-homogeneous directed graphs
• A classification of connected-homogeneous digraphs
• Homogeneous 2-partite digraphs