Hi all,

Just a reminder: this Thursday we will have next edition of "doktorandsky seminar". As announced on https://kam.mff.cuni.cz/~dsemweb/, our speaker will be David Mikšaník and he will talk about paper A. Bernshteyn, A. Dhawan: Fast algorithms for Vizing's theorem on bounded degree graphs https://arxiv.org/abs/2303.05408

Time: Thursday 9:50-12:10 Place: S8

We will recall how Vizing's theorem is proved, see an efficient algorithm for getting the coloring and an interesting technique to bound the algorithm running time (so-called Entropy compression method).

See you there,

R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University