arXiv Analytics

Sign in

arXiv:1409.4725 [math.CO]AbstractReferencesReviewsResources

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

Robert Brignall, Vincent Vatter

Published 2014-09-16Version 1

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.

Comments: To appear in the Journal of Combinatorics
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1608.00800 [math.CO] (Published 2016-08-02)
A simple proof of almost percolation on G(n;p)
arXiv:math/0304213 [math.CO] (Published 2003-04-15)
The enumeration of simple permutations
arXiv:2212.13096 [math.CO] (Published 2022-12-26)
A simple proof for the lower bound of the girth of graphs $D(n, q)$

Links

Toolbox