On November 15, 2022, Sebastian Wiederrecht from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the structure of graphs without certain matching minors and its applications in counting perfect matchings and computing permanent. The title of his talk was “Excluding single-crossing matching minors in bipartite graphs“.