# $2\times 2$ monotone grid classes are finitely based

Authors
Type
Published Article
Publication Date
Feb 08, 2016
Submission Date
Nov 02, 2015
Identifiers
arXiv ID: 1511.00473
Source
arXiv
In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain $2 \times 2$ (generalized) grid classes having two monotone cells in the same row.