An infinite antichain of permutations

zbMath0940.05002arXivmath/9812073MaRDI QIDQ1967117

Miklós Bóna, Daniel A. Spielmann

Publication date: 12 March 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9812073

zbMATH Keywords

antichainpartially ordered setfinite permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Related Items (12)

On the least exponential growth admitting uncountably many closed permutation classes ⋮ Labelled well-quasi-order for permutation classes ⋮ An infinite antichain of planar tanglegrams ⋮ Patterns in Shi tableaux and Dyck paths ⋮ WQO is decidable for factorial languages ⋮ Small Resolution Proofs for QBF using Dependency Treewidth ⋮ Unnamed Item ⋮ Embedding dualities for set partitions and for relational structures ⋮ The undecidability of joint embedding for 3-dimensional permutation classes ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Using decomposition-parameters for QBF: mind the prefix!

This page was built for publication: An infinite antichain of permutations