On the purity of maximal weakly separated set families
Combinatorics
2013-05-02 v3
Abstract
We present a short proof that every maximal family of weakly separated subsets of of cardinality between have the same size. Our proof is direct and only uses elementary combinatorics of lattice paths.
Cite
@article{arxiv.1111.6404,
title = {On the purity of maximal weakly separated set families},
author = {Hwanchul Yoo},
journal= {arXiv preprint arXiv:1111.6404},
year = {2013}
}
Comments
This paper has been withdrawn by the author