A survey of forbidden configuration results
R Anstee - the electronic journal of combinatorics, 2012 - combinatorics.org
Let $ F $ be a $ k\times\ell $(0, 1)-matrix. We say a (0, 1)-matrix $ A $ has $ F $ as a
configuration if there is a submatrix of $ A $ which is a row and column permutation of $ F …
configuration if there is a submatrix of $ A $ which is a row and column permutation of $ F …
[PDF][PDF] Forbidden Configurations: Exact bounds determined by critical substructures
We consider the following extremal set theory problem. Define a matrix to be simple if it is a
(0, 1)-matrix with no repeated columns. An $ m $-rowed simple matrix corresponds to a …
(0, 1)-matrix with no repeated columns. An $ m $-rowed simple matrix corresponds to a …
[PDF][PDF] A Survey of Forbidden Configuration Results (Draft)
RP Anstee - 2010 - Citeseer
Let F be ak× l (0, 1)-matrix (the forbidden configuration). We define a matrix to be simple if it
is a (0, 1)-matrix with no repeated columns. The matrix F need not be simple. Considering …
is a (0, 1)-matrix with no repeated columns. The matrix F need not be simple. Considering …