Abstract
AbstractIn 1993, Fishburn and Graham established the following qualitative extension of the classical Erdős–Szekeres theorem. If is sufficiently large with respect to , then any real matrix contains an submatrix in which every row and every column is monotone. We prove that the smallest such is at most , greatly improving the previously best known double‐exponential upper bound of Bucić, Sudakov, and Tran, and matching the best known lower bound on an exponential scale. In particular, we prove the following surprisingly sharp transition in the asymmetric setting. On one hand, every matrix contains an submatrix, in which every row is monotone. On the other hand, there exist matrices containing no such submatrix.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
