An Infinite Antichain of Permutations

Simple item page
dc.creatorBóna, Miklós
dc.creatorSpielman, Daniel A.
dc.date1998-12-11
dc.date.accessioned2026-07-07T05:27:13Z
dc.date.available2026-07-07T05:27:13Z
dc.descriptionWe constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.
dc.identifierhttps://arxiv.org/abs/math/9812073
dc.identifierhttp://arxiv.org/abs/math/9812073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77837
dc.subjectCombinatorics
dc.subject06A07
dc.titleAn Infinite Antichain of Permutations
dc.typetext

Files

Collections

arXiv