Joanna Fawcett

Description

Title: Tree-homogeneous graphs

Abstract:
Let X be a class of graphs. A graph G is X-homogeneous if every graph isomorphism f:H→K between finite induced subgraphs H and K of G with H in X extends to an automorphism of G. For example, if X consists of the graph with one vertex, then X-homogeneity is vertex-transitivity. We will discuss various interesting choices for X, one of which is the class of trees, in which case X-homogeneous graphs are said to be tree-homogeneous. We will discuss some recent progress on classifying the finite tree-homogeneous graphs, as well as some connections with certain highly symmetric incidence geometries called partial linear spaces.

Period	29 Apr 2019
Visiting from	Imperial College London (United Kingdom)
Visitor degree	PhD