A006626
Zarankiewicz's problem k_4(n,n+1).
Original entry on oeis.org
19, 27, 37, 46, 56, 68, 80, 94, 109
Offset: 4
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A006621
Zarankiewicz's problem k_3(n,n+1).
Original entry on oeis.org
11, 17, 23, 30, 38, 46, 55, 65, 75, 87
Offset: 3
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A006614
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.
Original entry on oeis.org
14, 21, 26, 32, 41, 48, 56, 67
Offset: 4
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
- 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.
- Dmitry I. Ignatov, When contranominal scales give a solution to the Zarankiewicz problem?, Workshop Notes, 12th Int'l Wksp. Formal Concept Analysis Artif. Intel. (FCA4AI 2024), 27-38. See p. 35.
Cf.
A006613,
A006615,
A006616,
A006617,
A006618,
A006619,
A006620,
A006621,
A006622,
A006623,
A006624,
A006625,
A006626.
A006615
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 3 X 4 submatrix.
Original entry on oeis.org
15, 22, 31, 38, 46, 57
Offset: 4
- R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Cf.
A006613,
A006614,
A006616,
A006617,
A006618,
A006619,
A006620,
A006621,
A006622,
A006623,
A006624,
A006625,
A006626.
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.
Original entry on oeis.org
12, 18, 26, 33, 41, 51
Offset: 3
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Cf.
A006613,
A006614,
A006615,
A006616,
A006617,
A006618,
A006619,
A006620,
A006621,
A006623,
A006624,
A006625,
A006626.
A006625
A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+2) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
Original entry on oeis.org
14, 21, 28, 36, 45, 55
Offset: 3
- R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Cf.
A006613,
A006614,
A006615,
A006616,
A006617,
A006618,
A006619,
A006620,
A006621,
A006622,
A006623,
A006624,
A006626.
Showing 1-6 of 6 results.
Comments