

A006616


Zarankiewicz's problem.
(Formerly M4998)


0




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

Table of n, a(n) for n=4..8.
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 manyfacetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129148.


CROSSREFS

Sequence in context: A317380 A070572 A176657 * A225929 A179370 A166675
Adjacent sequences: A006613 A006614 A006615 * A006617 A006618 A006619


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane.


STATUS

approved



