37 citations · 79 across the 37 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
The Erdős-Ko-Rado theorem for -intersecting families of perfect matchings
Shaun Fallat, Karen Meagher, Mahsa N. Shirazi
A perfect matching in the complete graph on vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect mat…
math.CO2020★ 1 cited
Complex Hadamard Diagonalisable Graphs
Ada Chan, Shaun Fallat, Steve Kirkland +3
In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex…