Complexity of spatial embeddings of graphs
Duration: 57 mins 46 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Bukh, B (Cambridge)
Monday 10 January 2011, 10:00-11:00 |
|---|
| Created: | 2011-01-11 09:18 | ||||
|---|---|---|---|---|---|
| Collection: | Discrete Analysis | ||||
| Publisher: | Isaac Newton Institute | ||||
| Copyright: | Bukh, B | ||||
| Language: | eng (English) | ||||
| Credits: |
|
||||
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.84 Mbits/sec | 801.32 MB | View | Download | |
| WebM | 640x360 | 1.2 Mbits/sec | 519.99 MB | View | Download | |
| Flash Video | 484x272 | 568.74 kbits/sec | 240.63 MB | View | Download | |
| iPod Video | 480x270 | 506.25 kbits/sec | 214.19 MB | View | Download | |
| MP3 | 44100 Hz | 125.01 kbits/sec | 52.70 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||