Special TK_5 in graphs containing K_4^-

Dissertation Defense
Friday, September 2, 2016 - 14:00
1.5 hours (actually 80 minutes)
Skiles 005
School of Mathematics, Georgia Tech
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.