Title	Connected-homogeneous digraphs
Creator	Hamann, Matthias
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2015-11-12T16:41
Description	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.
Extent	28 minutes
Subject	Mathematics; Combinatorics; Dynamical systems and ergodic theory; Logic and foundations
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Hamburg
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2016-05-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0302689
URI	http://hdl.handle.net/2429/58144
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos