3 citations · 4 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2004
Complexes of graphs with bounded matching size
Svante Linusson, John Shareshian, Volkmar Welker
For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along w…
math.CO2004★ 1 cited
Torsion in the Matching Complex and Chessboard Complex
John Shareshian, Michelle L. Wachs
Topological properties of the matching complex were first studied by Bouc in connection with Quillen complexes, and topological properties of the chessboard complex were first stud…
math.CO2003★ 3 cited
A New Approach to Order Polynomials of Labeled Posets and Their Generalizations
John Shareshian, David Wright, Wenhua Zhao
In this paper, we first give formulas for the order polynomial $Ω(\Pw; t)$ and the Eulerian polynomial $e(\Pw; λ)$ of a finite labeled poset using the adjacency matrix of…