Todos los cursos serán en inglés – All courses will be given in English.
Course 1: Sketching Algorithms
Lecturer: Jelani Nelson
Teaching Assistant: TBD
Abstract:
Course 2: Hadwiger’s Conjecture
Lecturer: Zi-Xia Song
Teaching Assistants: TBD
Abstract:
Hadwiger’s Conjecture from 1943 states that for every integer t ≥ 1, every graph with no Kt minor is (t − 1)-colorable. This is a far-reaching generalization of the Four-Color Theorem and perhaps the most famous conjecture in graph theory. Until recently the best known upper bound on the chromatic number of graphs with no Kt minor is O(t(log t)1/2), obtained independently by Kostochka and Thomason in 1984, while joint with Norin and Postle, we improved the frightening (log t)1/2 term to (log t)1/4 in 2019. The current record, O(t log log t), is due to Delcourt and Postle. In this short course we will survey the history of Hadwiger’s Conjecture and discuss the main ideas of our results. We will also discuss our recent results on two strengthening of the conjecture: Odd Hadwiger’s Conjecture and Dominating Hadwiger’s conjecture.
Course 3: TBD
Lecturer: TBD
Teaching Assistants: TBD
Abstract:
Note: Due to unforeseen circumstances, Professor Ioan Todinca will not be able to participate in the school. Another course will be offered. Nota: Por motivos de fuerza mayor, el profesor Ioan Todinca no podrá participar en la escuela. Se dictará otro curso.