BIRS Workshop Lecture Videos
Connected-homogeneous digraphs Hamann, Matthias
A directed graph is connected-homogeneous if any isomorphism between every two finite connected subdigraphs extends to an automorphism of the digraph. In this talk we discuss the the classification of the countable such digraphs. This includes a description of the main classes of these digraphs as well as a discussion of the main steps in the proof of the classification. In the end we give arguments that show that their classification is on the one hand complete but on the other hand still incomplete.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International