A006622 - OEIS

A006622

A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+1) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
(Formerly M4826)

12, 18, 26, 33, 41, 51

(list; graph; refs; listen; history; text; internal format)

OFFSET

3,1

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..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 many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.

CROSSREFS

Cf. A006613, A006614, A006615, A006616, A006617, A006618, A006619, A006620, A006621, A006623, A006624, A006625, A006626.

Cf. A001197, A072567, A191965, A191873, A001198, A205805, A347473, A347474, A350304, A350237.

Sequence in context: A325387 A272860 A071354 * A124269 A361080 A179192

Adjacent sequences: A006619 A006620 A006621 * A006623 A006624 A006625

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

Name edited at the suggestion of Sean A. Irvine and a(8) added by Max Alekseyev, Feb 02 2024

STATUS

approved