collaborators

1 paper

math.CO2019

Perfect matchings and derangements on graphs

Matija Bucic, Pat Devlin, Mo Hendon +2

We show that each perfect matching in a bipartite graph intersects at least half of the perfect matchings in . This result has equivalent formulations in terms of the perman…