Results 1 
2 of
2
DavenportSchinzel Theory Of Matrices
"... Let C be a configuration of 1's. We define f(n; C) to be the maximal number of 1's in a 01 matrix of size n \Theta 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 others we prove that f(n; i 1 1 1 ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
Let C be a configuration of 1's. We define f(n; C) to be the maximal number of 1's in a 01 matrix of size n \Theta 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 others we prove that f(n; i 1 1 1 1 j ) = \Theta(ff(n)n), where ff(n) is the inverse of the Ackermann function.