Balanced matrices with row sum 3 (Q1336681)

A \((0,1)\) matrix is balanced if it contains no square submatrix of odd size in which each row and column contains exactly two 1's. A \((0,1)\) square matrix \(A\) is unimodular if it has a determinant equal to \(\pm 1\). A \((0,1)\) matrix (not necessarily square) is totally unimodular if every square submatrix, including \(A\) itself, has a determinant equal to \(-1\), 0, or \(+1\). The author proves the following theorem: Let \(A\) be a \((0,1)\) matrix with row sums \(\leq 3\). Then \(A\) is balanced if and only if \(A\) is totally unimodular.