2×2 monotone grid classes are finitely based

Albert, Michael and Brignall, Robert (2016). 2×2 monotone grid classes are finitely based. Discrete Mathematics & Theoretical Computer Science, 18(2), article no. 1.

URL: http://dmtcs.episciences.org/1378

Abstract

In this note, we prove that all 2×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×2 (generalized) grid classes having two monotone cells in the same row.

Viewing alternatives

Item Actions

Export

You can export this page using these formats