Exact Bounds for Forbidden Configurations and the Extremal Matrices

Richard P. Anstee, Oakley Edens, Arvin Sahami +2

Let $F$ be a $k\times \ell$ (0,1)-matrix. A matrix is simple if it is a (0,1)-matrix with no repeated columns. A (0,1)-matrix $A$ is said to have a $F$ as a configuration if there…