An Infinite Antichain of Permutations

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.

• Type: Journal
• Year: 2000
• Where: COMBINATORICS
• Authors: Daniel A. Spielman, Miklós Bóna
• Keywords: COMBINATORICS 2000, Infinite Antichain, Permutations