加载中…
Let be a permutation class that does not contain all layered permutations or all colayered permutations. We prove that there is a constant such that every permutation in of length contains a monotone subsequence of length .

生成讲解博客的中文版本

生成AI智能校验的中文版本