ACO The ACO Seminar (2011-2012)

Oct 20, 3:30pm, Wean 8220
Boris Bukh, University of Cambridge
Space crossing numbers


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.

Back to the ACO home page