On maximal weakly separated set-systems


For a permutation ω ∈ Sn, Leclerc and Zelevinsky in Am. Math. Soc. Transl., Ser. 2 181, 85–108 (1998) introduced the concept of an ω-chamber weakly separated collection of subsets of {1,2, . . . , n} and conjectured that all inclusionwise maximal collections of this sort have the same cardinality (ω)+n+1, where (ω) is the length of ω. We answer this… (More)


3 Figures and Tables

Cite this paper

@inproceedings{Danilov2009OnMW, title={On maximal weakly separated set-systems}, author={Vladimir I. Danilov and Alexander V. Karzanov and Gleb A. Koshevoy}, year={2009} }