Building bridges between graph colouring, extremal and structural graph theory KU Leuven
The goal of this project is to make progress on and connect different important subareas of graph theory.
To this end we will focus on two research lines, both involving an in-depth analysis of extremal examples.
The main research line is about
I. Hadwiger’s conjecture and offsprings
Hadwiger’s conjecture is one of the most important conjectures in graph theory. If true, it would connect two large subareas, graph colouring ...