Abstract
A (0, 1)-matrix contains anS 0(k) if it has 0-cells (i, j 1), (i + 1,j 2),..., (i + k − 1,j k) for somei andj 1 < ... < jk, and it contains anS 1(k) if it has 1-cells (i 1,j), (i 2,j + 1),...,(i k ,j + k − 1) for somej andi 1 < ... <i k . We prove that ifM is anm × n rectangular (0, 1)-matrix with 1 ≤m ≤ n whose largestk for anS 0(k) isk 0 ≤m, thenM must have anS 1(k) withk ≥ ⌊m/(k 0 + 1)⌋. Similarly, ifM is anm × m lower-triangular matrix whose largestk for anS 0(k) (in the cells on or below the main diagonal) isk 0 ≤m, thenM has anS 1(k) withk ≥ ⌊m/(k 0 + 1)⌋. Moreover, these results are best-possible.
Similar content being viewed by others
References
Chung, F.R.K., Fishburn, P.C., Wei, V.K.: Cross-monotone subsequences. Order1, 351–369 (1985)
Erdös, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math.2, 463–470 (1935)
Kruskal, J.B., Jr.: Monotonic subsequences. Proc. Amer. Math. Soc.4, 264–274 (1953)
Seidenberg, A.: A simple proof of a theorem of Erdös and Szekeres. J. London Math. Soc.34, 352 (1959)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chung, F.R.K., Fishburn, P.C. & Wei, V.K. Monotone subsequences in (0, 1)-matrices. Graphs and Combinatorics 2, 31–36 (1986). https://doi.org/10.1007/BF01788074
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788074