![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Monday 10 January 2011, 10:00-11:00
Complexity of spatial embeddings of graphs
â ī¸ Important: Discrete Analysis
- đ¤ Speaker: Bukh, B (Cambridge)
- đ Date & Time: Monday 10 January 2011, 10:00 - 11:00
- đ Venue: Seminar Room 1, Newton Institute
Questions? Contact
Mustapha Amrani
Abstract
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.