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

DOI10.4310/JOC.2015.v6.n1.a3zbMath1312.05004arXiv1409.4725MaRDI QIDQ2345765

Vincent R. Vatter, Robert Brignall

Publication date: 20 May 2015

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.4725

zbMATH Keywords

Schmerl and Trotter theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (3)

Labelled well-quasi-order for permutation classes ⋮ Symmetric maximal Condorcet domains ⋮ Letter graphs and modular decomposition

Uses Software

• PermLab

This page was built for publication: A simple proof of a theorem of Schmerl and Trotter for permutations