Ben Lund gave a talk on an interesting property of perfect matchings in a bipartite graphs at the Discrete Math Seminar

On January 19, 2021, Ben Lund from the IBS Discrete Mathematics Group presented his result with Matija Bucic, Pat Devlin, Mo Hendon, and Dru Horne showing that each perfect matching in a bipartite graph intersects at least half of all perfect matchings. The title of his talk was “Perfect matchings and derangements on graphs“.