skip to content
 

Complexity of spatial embeddings of graphs

Presented by: 
B Bukh [Cambridge]
Date: 
Monday 10th January 2011 - 10:00 to 11:00
Venue: 
INI Seminar Room 1
Abstract: 
We introduce a measure of topological complexity of an embedding of a graph into R^3. We show that the notion strengthens the crossing number for graph embeddings in R^2, 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.
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