A006617 Zarankiewicz's problem.

6, 10, 14, 19, 25, 30, 36, 43, 51, 57

Offset: 2

Author

N. J. A. Sloane

Keywords

• nonn
• more

Comments

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 3 submatrix. - Sean A. Irvine, May 17 2017

References

• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• R. K. Guy, A problem of Zarankiewicz, Research Paper No. 12, Dept. of Math., Univ. Calgary, Jan. 1967. [Annotated and scanned copy, with permission]
• R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.