PIMS-UVic Discrete Math Seminar: Shoham Letzter
Topic
An improvement on Łuczak's connected matchings method [video]
Speakers
Details
A connected matching is a matching contained in a connected component. A well-known method due to Łuczak reduces problems about monochromatic paths and cycles in complete graphs to problems about monochromatic matchings in almost complete graphs. We show that these can be further reduced to problems about monochromatic connected matchings in complete graphs.
I will describe Łuczak's reduction, introduce the new reduction, and mention potential applications of the improved method.
This event took place via zoom and a recording of it is available on mathtube.org.
Additional Information
For more details on the seminar and to obtain the online details, please see the UVic Discrete Math Seminar Page.
Shoham Letzter, University College London