An Infinite Antichain of Permutations

  • Daniel A. Spielman
  • Miklós Bóna
DOI: https://doi.org/10.37236/1540

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.

Published
2000-03-02
How to Cite
Spielman, D. A., & Bóna, M. (2000). An Infinite Antichain of Permutations . The Electronic Journal of Combinatorics, 7(1), N2. https://doi.org/10.37236/1540
Issue
Volume 7 (2000)
Article Number
N2