Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Abstract
For a permutation pi in Sk, a pi-wave is an increasing sequence of integers whose consecutive gaps have relative order pi. Let g(pi, n) be the maximum cardinality of a pi-wave-free subset of [n], and let P(pi, r) be the least integer N such that every r-coloring of [N] contains a monochromatic pi-wave. We determine the asymptotic orders of both functions for every permutation of length at most five. Existing upper bounds and weak-wave constructions provide sharp bounds for all but eight length-five patterns in S5. For these eight exceptional alternating patterns, we establish g(pi, n) = Theta((log n)squared) and P(pi, r) = Theta(r(log r)squared).
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz
The Iterated Local Transitivity Model for oriented graphs
Anthony Bonato, MacKenzie Carr, Ketan Chaudhary et al.