Abstract
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infinite collection of permutations no one of which contains another as a pattern.
Cite
CITATION STYLE
APA
Spielman, D. A., & Bóna, M. (2000). An infinite antichain of permutations. Electronic Journal of Combinatorics, 7(1 N), 1–4. https://doi.org/10.37236/1540
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free