Nathan Lindzey

most citedSpeeding Up Graph Algorithms via Switching Classes

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

Jack Derangements

Nathan Lindzey

For each integer partition $λ ⊢ n$ we give a simple combinatorial expression for the sum of the Jack character $θ_{α}^{λ}$ over the integer partitions of $n$ with no singleton part…

math.CO2014

Erdős-Ko-Rado for Perfect Matchings

Nathan Lindzey

A perfect matching of a complete graph $K_{2 n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $…

cs.DS2014★ 1 cited

Speeding Up Graph Algorithms via Switching Classes

Nathan Lindzey

Given a graph $G$ , a vertex switch of $v \in V (G)$ results in a new graph where neighbors of $v$ become nonneighbors and vice versa. This operation gives rise to an equivalence rel…