Debsoumya Chakraborti gave a talk on finding a rainbow matching in an edge-colored graph at the Discrete Math Seminar

On December 1, 2020, Debsoumya Chakraborti from the IBS Discrete Mathematics Group presented his theorem with Po-Shen Loh about the existence of a rainbow matching of size q in a simple graph whose edges are colored properly by 2q+o(q) colors. The title of his talk was “Rainbow matchings in edge-colored simple graphs“.