University of Cambridge > > Isaac Newton Institute Seminar Series > Homogeneity in graphs

Homogeneity in graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

This talk has been canceled/deleted

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.


© 2006-2021, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity