skip to content
 

Homogeneity in graphs

Presented by: 
Joanna Fawcett
Date: 
Thursday 12th March 2020 - 16:00 to 17:00
Venue: 
INI Seminar Room 2
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. In this talk, we will discuss various interesting choices for X.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons