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.
math.CO↗
arXiv subjects
Publications and source records attributed to Daniel A. Spielman.
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.