3 papers
math.CO2026
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…
math.CO2025
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…
math.CO2024
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…