Let C be a configuration of 1's. We define f(n;C) to be the maximal number of 1's in a 0-1 matrix of size n × n not having C as a subconfiguration. We consider the problem of determining the order of f(n;C) for several forbidden C's. Among other results we prove that f(n;1111) = Θ(α(n)n), where α(n) is the inverse of the Ackermann function.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics