Seunghun Lee (이승훈) gave a talk on the complexes of subgraphs having no large matching at the Discrete Math Seminar

On April 28, 2020, Seunghun Lee (이승훈) from KAIST presented a talk on the topological property of the non-matching complex, that is a simplicial complex consisting of subgraphs on the same vertex set having no matching of size k and its application to the rainbow matching problem of graphs. The title of his talk is “Leray numbers of complexes of graphs with bounded matching number“.