Alexey Pokrovskiy "Rainbow matchings in coloured multigraphs"
Alexey Pokrovskiy from University College London will give the talk "Rainbow matchings in coloured multigraphs" on the labs' Big Seminar.
Password: first 6 decimal places of $\pi$ after the decimal point
You can also write to Alexander Polyanskii (alexander.polyanskii@yandex.ru) or to Maksim Zhukovskii (zhukmax@gmail.com) if you want to be added to mailing list.
Abstract:
This talk will be about taking a coloured multigraph and finding a rainbow matching using every colour. There's a variety of conjectures that guarantee a matching like this in various classes of multigraphs (eg the Aharoni-Berger Conjecture). In the talk, I'll discuss an easy technique to prove asymptotic versions of conjectures in this area.
This is joint work with David Munhá Correia and Benny Sudakov
Watch the video:
Everyone is invited to attend. The language of the lecture is English. The event is aimed at master and graduate students, as well as researchers in the field of combinatorics.