Ben Lund, Perfect matchings and derangements on graphs
Room B232 IBS (기초과학연구원)We show that each perfect matching in a bipartite graph G intersects at least half of the perfect matchings in G. This result has equivalent formulations in terms of the permanent …