Wednesday, February 3, 2021


Luke joined the C&O department in 2014, after completing his Ph.D. at Georgia Tech and a postdoctoral fellowship at Emory University. His research interests are in structural and topological graph theory, graph colouring, and matroid theory. He has made many important contributions to old and difficult problems in graph theory, including Hadwiger's Conjecture, the Goldberg-Seymour Conjecture, Reed's Conjecture, and Jaeger's Conjecture. With Zdenek Dvorak, he introduced a new generalization of graph colouring called corresponding colouring (also known as DP-colouring), which has been used by many researchers to solve problems in list colouring.
You can read the CMS announcement here.