Complexity of spatial embeddings of graphs
Seminar Room 1, Newton Institute
AbstractWe 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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.