

A006618


Zarankiewicz's problem.
(Formerly M4775)


0




OFFSET

3,1


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 4 submatrix.  Sean A. Irvine, May 18 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=3..10.
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: A176603 A325902 A050715 * A184551 A190039 A066074
Adjacent sequences: A006615 A006616 A006617 * A006619 A006620 A006621


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane.


STATUS

approved



