![]() |
Discrete Mathematics & Theoretical Computer Science |
Let $\mathcal{C}$ be a permutation class that does not contain all layered permutations or all colayered permutations. We prove that there is a constant $c$ such that every permutation in $\mathcal{C}$ of length $n$ contains a monotone subsequence of length $cn$.
Source : ScholeXplorer
IsRelatedTo ARXIV 1910.04813 Source : ScholeXplorer IsRelatedTo DOI 10.1214/20-aihp1135 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1910.04813
|