An infinite antichain of permutations.
Spielmann, Daniel A.; Bóna, Miklós
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper N2, 4 p.-Research paper N2, 4 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topSpielmann, Daniel A., and Bóna, Miklós. "An infinite antichain of permutations.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper N2, 4 p.-Research paper N2, 4 p.. <http://eudml.org/doc/120385>.
@article{Spielmann2000,
author = {Spielmann, Daniel A., Bóna, Miklós},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {partially ordered set; finite permutations; antichain},
language = {eng},
number = {1},
pages = {Research paper N2, 4 p.-Research paper N2, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {An infinite antichain of permutations.},
url = {http://eudml.org/doc/120385},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Spielmann, Daniel A.
AU - Bóna, Miklós
TI - An infinite antichain of permutations.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper N2, 4 p.
EP - Research paper N2, 4 p.
LA - eng
KW - partially ordered set; finite permutations; antichain
UR - http://eudml.org/doc/120385
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.