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 2 X 2 submatrix.
A006620
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 2 X 2 submatrix.
Terms
- a(0) =5a(1) =8a(2) =11a(3) =15a(4) =19a(5) =23a(6) =27a(7) =32a(8) =37a(9) =43a(10) =49a(11) =54a(12) =59a(13) =64
External references
- oeis: A006620