M-Shellability of Discrete Polymatroids
classification
🧮 math.CO
keywords
conjecturediscreteanswercasecharieverygivesimproves
read the original abstract
In this note we show that every discrete polymatroid is $M$-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 $h$-vector of a lattice path matroid satisfies a conjecture of Stanley.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.