- Series
- Dissertation Defense
- Time
- Friday, September 2, 2016 - 2:00pm for 1.5 hours (actually 80 minutes)
- Location
- Skiles 005
- Speaker
- Dawei He – School of Mathematics, Georgia Tech
- Organizer
- Dawei He
The well-known Kelmans-Seymour conjecture states that every
nonplanar 5-connected graph contains TK_5. Ma and Yu prove the conjecture
for graphs containing K_4^- . In the thesis, we will find special TK_5 in
graphs containing K_4^-, i.e. two versions of generalization of their result
will be dealt with separately.