Complexity of spatial embeddings of graphs

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

• Bukh, B (Cambridge)
• Monday 10 January 2011, 10:00-11:00
• Seminar Room 1, Newton Institute.

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 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.

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

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.