3 citations · 6 across the 9 of their papers we have counts for
11 papers
Exact Bounds for Forbidden Configurations and the Extremal Matrices
Richard P. Anstee, Oakley Edens, Arvin Sahami +2
Let be a (0,1)-matrix. A matrix is simple if it is a (0,1)-matrix with no repeated columns. A (0,1)-matrix is said to have a as a configuration if there…
Forbidden Configurations and Boundary Cases
Richard P. Anstee, Oakley Edens, Arvin Sahami +1
Let be a (0,1)-matrix. Define a (0,1)-matrix to have a as a \emph{configuration} if there is a submatrix of which is a row and column permutation of…
Stability Theorems for Forbidden Configurations
Richard P. Anstee, Benjamin Kreiswirth, Bowen Li +2
Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of th…
Design Theory and some Forbidden Configurations
R. P. Anstee, Farzin Barekat, Zachary Pellegrin
In this paper we relate t-designs to a forbidden configuration problem in extremal set theory. Let 1_t 0_l denote a column of t 1's on top of l 0's. We assume t>l. Let q. (1_t 0_l)…
Design Theory and Some Non-simple Forbidden Configurations
R. P. Anstee, Farzin Barekat
Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_λ(2,3,v) can be defi…
Multivalued matrices and forbidden configurations
Richard Anstee, Jeffrey Dawson, Linyuan Lu +1
An -matrix is a matrix with symbols in . A matrix is simple if it has no repeated columns. Let be a finite set of -matrices. Let $\hbox{forb}(m…