A simple proof of a theorem of Schmerl and Trotter for permutations

Abstract

When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this result.

arXiv commentTo appear in the Journal of Combinatorics