BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Complexity of spatial embeddings of graphs - Bukh\, B (Cambridge)
DTSTART:20110110T100000Z
DTEND:20110110T110000Z
UID:TALK28798@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We introduce a measure of topological complexity of an embeddi
 ng of a graph into R^3. We show that the notion strengthens the crossing n
 umber for graph embeddings in R^2\, and that the complexity of expander gr
 aphs is high\, as expected. We will also discuss the questions related to 
 generalisations to higher dimensions.  Joint work with Alfredo Hubard.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR