Events by date

Title: On the eigenvalues of the perfect matching derangement graph

Speaker: Mahsa N. Shirazi Affiliation: University of Regina Zoom: Contact Sabrina Lato for link

Abstract:

The perfect matching derangement graph $M_{2n}$ is defined to be the graph whose vertices are all the perfect matchings of the complete graph $K_{2n}$, and two vertices are adjacent if they contain no common edges. The graph $M_{2n}$ is part of a larger study on the analogs of the Erdős-Ko-Rado theorem, and recently there have been interesting works on $M_{2n}$ and its eigenvalues.