# Hadwiger's Conjecture for Symmetric Graphs

Discrete Structures and Algorithms (Seminar)
Ph.D. Confirmation Talk

#### by Bin Jia

Institution: The University of Melbourne
Date: Wed 21st March 2012
Time: 10:00 AM
Location: Room 215, Richard Berry Building

Abstract: In graph theory, Hadwiger's conjecture states that, every simple graph of chromatic number $t$ has a minor isomorphic to the complete graph $K_t$. My proposed PhD research topic is to verify this conjecture for various families of graphs with certain symmetries. Therefore, my research lies in the intersection of two major disciplines, namely structural and algebraic graph theories. The former discipline is focused on graph coloring and minors, while the latter studies algebraically defined graphs, such as circulant graphs, Cayley graphs and symmetric graphs, etc.