Data: 27/08/2020, às 14:00 horas (GMT-3, horário de Brasília).
Título: On the edge of edge-colouring
Palestrante: Leandro Zatesko (UTFPR)


Abstract: What makes a hard problem hard? In this talk, we approach intriguing facts and state-of-the-art results concerning edge-colouring simple graphs, a problem which many researchers from our latin-american community have been studied. In particular, we present a novel recolouring procedure which extends the well-known Vizing's recolouring procedure of 1964, leading to results which contribute towards settling the Overfull Conjecture, a main open problem on edge-colouring simple graphs.