Keynote Speaker:Song Zixia

Abstract:

Hadwiger’s conjecture from 1943 states that for every integer t ≥ 1, every graph either can be t-colored or has a subgraph that can be contracted to the complete graph on t+1 vertices. This is a far-reaching generalization of the Four-Color Theorem and perhaps the most famous conjecture in graph theory. In this talk, we will give a rigorous introduction to this conjecture, including its current progress and related problems.

Introduction to the Speaker:

Song Zixia, Professor and Doctoral Supervisor in the Department of Mathematics of the University of Central Florida in the United States. Her main research field is graph theory. From 2000 to 2004, she obtained his doctorate in Algorithm, Combinatorics and Optimization from Georgia Institute of Technology. From 2004 to 2005, she had engaged in postdoctoral research in the Department of Mathematics of the Ohio State University. In 2005, she was employed by the Department of Mathematics of the University of Central Florida in the United States. She was awarded the 2009 to 2011 NSA research fund, and has served as the fund judge of NSF. In 2013, she was awarded the Outstanding Teacher Award of the University. She has published many SCI papers in the top journals of graph theory, such asSIAM Journal on Discrete Mathematics, andJournal of Graph Theory.

Inviter:

Wang Guanghui, Professor of School of Mathematics

Time:

9:00 on October 9 (Friday)

Location:

Zoom Meeting, ID: 890 901 6918

Password: 123456

Sponsored by: School of Mathematics, Shandong University