Just a reminder: this Thursday we will have next edition of "doktorandsky seminar". As we agreed last week, we will have David Mikšaník finishing presentation of the paper A. Bernshteyn, A. Dhawan: Fast algorithms for Vizing's theorem on bounded degree graphs https://arxiv.org/abs/2303.05408
This presentation will be more or less independent of last week. We will see the famous entropy-compression method in action: the same method that is the base of algorithmic version of Lovasz local lemma. It won't be long, thus we start at 10:40 to accomodate more people.