$M$-Shellability of Discrete Polymatroids
Combinatorics
2010-12-07 v1
Abstract
In this note we show that every discrete polymatroid is -shellable. This gives, in a partial case, a positive answer to a conjecture of Chari and improves a recent result of Schweig where he proved that the -vector of a lattice path matroid satisfies a conjecture of Stanley.
Cite
@article{arxiv.1012.1075,
title = {$M$-Shellability of Discrete Polymatroids},
author = {Majid Alizadeh and Afshin Goodarzi and Siamak Yassemi},
journal= {arXiv preprint arXiv:1012.1075},
year = {2010}
}
Comments
4 pages