Tutte seminar - Bruce Richter

Friday, February 15, 2008 3:30 pm - 4:30 pm EST (GMT -05:00)

2-crossing-critical graphs

Speaker: Bruce Richter
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A graph G is k-crossing-critical if its crossing number is at least k, but every proper subgraph has crossing number at most k-1. (We may assume minimum degree at least 3.) The only 1-crossing-critical graphs arise from Kuratowski's Theorem. 
In this talk, I will describe our efforts to find all the 2-crossing-critical graphs.

Joint work with Drago Bokal and Gelasio Salazar.