A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+1) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
A006622
A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+1) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
Terms
- a(0) =12a(1) =18a(2) =26a(3) =33a(4) =41a(5) =51
External references
- oeis: A006622