Involve: A Journal of Mathematics
- Volume 12, Number 2 (2019), 351-360.
Erdős–Szekeres theorem for cyclic permutations
We provide a cyclic permutation analogue of the Erdős–Szekeres theorem. In particular, we show that every cyclic permutation of length has either an increasing cyclic subpermutation of length or a decreasing cyclic subpermutation of length , and we show that the result is tight. We also characterize all maximum-length cyclic permutations that do not have an increasing cyclic subpermutation of length or a decreasing cyclic subpermutation of length .
Involve, Volume 12, Number 2 (2019), 351-360.
Received: 7 April 2018
Revised: 9 July 2018
Accepted: 22 July 2018
First available in Project Euclid: 25 October 2018
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 05D99: None of the above, but in this section
cyclic Erdős–Szekeres theorem
Czabarka, Éva; Wang, Zhiyu. Erdős–Szekeres theorem for cyclic permutations. Involve 12 (2019), no. 2, 351--360. doi:10.2140/involve.2019.12.351. https://projecteuclid.org/euclid.involve/1540432925