

A006616


Zarankiewicz's problem k_4(n).
(Formerly M4998)


8




OFFSET

4,1


COMMENTS

a(n) is the least k such that every n X n {0,1}matrix with k ones contains an all ones 4 X 4 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]


FORMULA



CROSSREFS



KEYWORD

nonn,hard,more


AUTHOR



EXTENSIONS



STATUS

approved



