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 2 X 4 submatrix.
A006614
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 2 X 4 submatrix.
Terms
- a(0) =14a(1) =21a(2) =26a(3) =32a(4) =41a(5) =48a(6) =56a(7) =67
External references
- oeis: A006614