login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006617 Zarankiewicz's problem.
(Formerly M4083)
5

%I M4083 #17 Dec 26 2021 21:51:58

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

%N Zarankiewicz's problem.

%C 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

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

%H R. K. Guy, <a href="/A001197/a001197.pdf">A problem of Zarankiewicz</a>, Research Paper No. 12, Dept. of Math., Univ. Calgary, Jan. 1967. [Annotated and scanned copy, with permission]

%H R. K. Guy, <a href="http://dx.doi.org/10.1007/BFb0060112">A many-facetted problem of Zarankiewicz</a>, Lect. Notes Math. 110 (1969), 129-148.

%K nonn,more

%O 2,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 21:57 EDT 2024. Contains 371254 sequences. (Running on oeis4.)