On partial well-order for monotone grid classes of permutations
classification
🧮 math.CO
keywords
gridmonotoneclassclassespermutationsconditionscontainmentdefined
read the original abstract
A monotone grid class is a permutation class (i.e., a downset of permutations under the containment order) defined by local monotonicity conditions. We give a simplified proof of a result of Murphy and Vatter that monotone grid classes of forests are partially well-ordered.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.