Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M4925 #28 Nov 05 2024 12:13:15
%S 14,21,26,32,41,48,56,67
%N A variant of Zarankiewicz's problem: a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all-ones 2 X 4 submatrix.
%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.
%H Dmitry I. Ignatov, <a href="https://fca4ai.hse.ru/mirror/pubs/share/direct/974862483.pdf#page=27">When contranominal scales give a solution to the Zarankiewicz problem?</a>, Workshop Notes, 12th Int'l Wksp. Formal Concept Analysis Artif. Intel. (FCA4AI 2024), 27-38. See p. 35.
%Y Cf. A006613, A006615, A006616, A006617, A006618, A006619, A006620, A006621, A006622, A006623, A006624, A006625, A006626.
%Y Cf. A001197, A072567, A191965, A191873, A001198, A205805, A347473, A347474, A350304, A350237.
%K nonn,more
%O 4,1
%A _N. J. A. Sloane_
%E Name updated at the suggestion of _Sean A. Irvine_ by _Max Alekseyev_, Feb 02 2024