University of Cambridge > > Isaac Newton Institute Seminar Series > Complexity of spatial embeddings of graphs

Complexity of spatial embeddings of graphs

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

If you have a question about this talk, please contact Mustapha Amrani.

Discrete Analysis

We introduce a measure of topological complexity of an embedding of a graph into R3. We show that the notion strengthens the crossing number for graph embeddings in R2, and that the complexity of expander graphs is high, as expected. We will also discuss the questions related to generalisations to higher dimensions. Joint work with Alfredo Hubard.

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:

Note that ex-directory lists are not shown.


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