2 citations · 2 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.CO2003★ 2 cited
Segre and Rees products of posets, with ring-theoretic applications
Anders Björner, Volkmar Welker
We introduce (weighted) Segre and Rees products for posets and show that these constructions preserve the Cohen-Macaulay property over a field and homotopically. As an applicat…
math.CO2003
Groebner basis degree bounds on $\Tor^{k[Λ]}_\bullet(k,k)_\bullet$ and discrete Morse theory for posets
Patricia Hersh, Volkmar Welker
The purpose of this paper is twofold. 1. We give combinatorial bounds on the ranks of the groups $\Tor^{R}_\bullet(k,k)_\bullet$ in the case where is an affine semi-grou…