On the number of monotone sequences

Wojciech Samotij, Benny Sudakov

Research output: Contribution to journalArticlepeer-review

Abstract

One of the most classical results in Ramsey theory is the theorem of Erdos and Szekeres from 1935, which says that every sequence of more than k2 numbers contains a monotone subsequence of length k+1. We address the following natural question motivated by this result: Given integers k and n with n≥k2+1, how many monotone subsequences of length k+1 must every sequence of n numbers contain? We answer this question precisely for all sufficiently large k and n≤k2+ck3/2/log k, where c is some absolute positive constant.

Original languageEnglish
Pages (from-to)132-163
Number of pages32
JournalJournal of Combinatorial Theory. Series B
Volume115
DOIs
StatePublished - 1 Nov 2015

Keywords

  • Erdos-Rademacher
  • Erdos-Szekeres
  • Monotone subsequences
  • Supersaturation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'On the number of monotone sequences'. Together they form a unique fingerprint.

Cite this