1 citations · 2 across the 14 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Erdős-Ko-Rado for Perfect Matchings
Nathan Lindzey
A perfect matching of a complete graph 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 , a vertex switch of results in a new graph where neighbors of become nonneighbors and vice versa. This operation gives rise to an equivalence rel…