A variant of Zarankiewicz's problem: a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
A006615
A variant of Zarankiewicz's problem: a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
Terms
- a(0) =15a(1) =22a(2) =31a(3) =38a(4) =46a(5) =57
External references
- oeis: A006615