Geodesic
An infinite antichain of permutations
The electronic journal of combinatorics, Tome 7 (2000)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
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.
DOI : 10.37236/1540
Classification : 05A05, 06A07
Mots-clés : partially ordered set, finite permutations, antichain 
Daniel A. Spielman; Miklós Bóna. An infinite antichain of permutations. The electronic journal of combinatorics, Tome 7 (2000). doi: 10.37236/1540
@article{10_37236_1540,
     author = {Daniel A. Spielman and Mikl\'os B\'ona},
     title = {An infinite antichain of permutations},
     journal = {The electronic journal of combinatorics},
     year = {2000},
     volume = {7},
     doi = {10.37236/1540},
     zbl = {0940.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1540/}
}
TY  - JOUR
AU  - Daniel A. Spielman
AU  - Miklós Bóna
TI  - An infinite antichain of permutations
JO  - The electronic journal of combinatorics
PY  - 2000
VL  - 7
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1540/
DO  - 10.37236/1540
ID  - 10_37236_1540
ER  - 
%0 Journal Article
%A Daniel A. Spielman
%A Miklós Bóna
%T An infinite antichain of permutations
%J The electronic journal of combinatorics
%D 2000
%V 7
%U http://geodesic.mathdoc.fr/articles/10.37236/1540/
%R 10.37236/1540
%F 10_37236_1540

Cité par Sources :