Matrix Partitions with Finitely Many Obstructions

We ask which matrix partition problems admit a characterization by a finite set of forbidden induced subgraphs. We prove some positive and some negative results; these are sufficient to classify all such problems with matrices of size up to five. We also consider related questions on the descriptive and computational complexity of matrix partition problems.