32 citations · 141 across the 41 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
math.CO2004
Completing a k-1 assignment
Svante Linusson, Johan Waestlund
We consider the distribution of the value of the optimal k-assignment in an m x n-matrix, where the entries are independent exponential random variables with arbitrary rates. We gi…
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…