A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+2) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
A006625
A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+2) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
Terms
- a(0) =14a(1) =21a(2) =28a(3) =36a(4) =45a(5) =55
External references
- oeis: A006625