Alexey Pokrovskiy 'Rainbow matchings in coloured multigraphs' | Big Seminar

It is our pleasure to share the Big Seminar talk "Rainbow matchings in coloured multigraphs" by Alexey Pokrovskiy.

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.