- Series
- Combinatorics Seminar
- Time
- Friday, November 21, 2008 - 3:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 255
- Speaker
- Nick Zhao – University of Central Florida
- Organizer
- Prasad Tetali
In 1968, Vizing proposed the following conjecture which claims that if G is an edge chromatic critical graph with n vertices, then the independence number of G is at most n/2. In this talk, we will talk about this conjecture and the progress towards this conjecture.