On the purity of maximal weakly separated set families
classification
🧮 math.CO
keywords
maximalproofseparatedweaklycardinalitycombinatoricsdirectelementary
read the original abstract
We present a short proof that every maximal family of weakly separated subsets of $[n]$ of cardinality between $[a,b]$ have the same size. Our proof is direct and only uses elementary combinatorics of lattice paths.
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.