$2\times 2$ monotone grid classes are finitely based
From MaRDI portal
Publication:2831884
zbMath1348.05005arXiv1511.00473MaRDI QIDQ2831884
Robert Brignall, Michael Henry Albert
Publication date: 3 November 2016
Full work available at URL: https://arxiv.org/abs/1511.00473
Related Items (3)
Labelled well-quasi-order for permutation classes ⋮ Juxtaposing Catalan permutation classes with monotone ones ⋮ Combinatorial generation via permutation languages. I. Fundamentals
This page was built for publication: $2\times 2$ monotone grid classes are finitely based