Abstract.
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along both sets of chains, the labels of the chains in the first set remain sorted. We also characterize posets with more restrictive sorting properties.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received October 19, 2005
Rights and permissions
About this article
Cite this article
Tenner, B.E. A Non-Messing-Up Phenomenon for Posets. Ann. Comb. 11, 101–114 (2007). https://doi.org/10.1007/s00026-007-0308-z
Issue Date:
DOI: https://doi.org/10.1007/s00026-007-0308-z