{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T00:22:55Z","timestamp":1716250975832},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Swiss Federal Institute of Technology Zurich"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The study of ordered Ramsey numbers of monotone paths for graphs and hypergraphs has a long history, going back to the celebrated work by Erd\u0151s and Szekeres in the early days of Ramsey theory. In this paper we obtain several results in this area, establishing two conjectures of Mubayi and Suk and improving bounds due to Balko, Cibulka, Kr\u00e1l and Kyn\u010dl. For example, in the graph case, we show that the ordered Ramsey number for a fixed clique versus a fixed power of a monotone path of length <jats:italic>n<\/jats:italic> is always linear in <jats:italic>n<\/jats:italic>. Also, in the 3-graph case, we show that the ordered Ramsey number for a fixed clique versus a tight monotone path of length <jats:italic>n<\/jats:italic> is always polynomial in <jats:italic>n<\/jats:italic>. As a by-product, we also obtain a color-monotone version of the well-known Canonical Ramsey Theorem of Erd\u0151s and Rado, which could be of independent interest.<\/jats:p>","DOI":"10.1007\/s00493-024-00082-7","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T19:02:37Z","timestamp":1709146957000},"page":"509-529","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ramsey Problems for Monotone Paths in Graphs and Hypergraphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Lior","family":"Gishboliner","sequence":"first","affiliation":[]},{"given":"Zhihan","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,28]]},"reference":[{"issue":"1","key":"82_CR1","first-page":"1","volume":"27","author":"M Balko","year":"2020","unstructured":"Balko, M., Cibulka, J., Kr\u00e1l, K., Kyn\u010dl, J.: Ramsey numbers of ordered graphs. Electron. J. Comb. 27(1), 1\u201316 (2020)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"82_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00222-010-0247-x","volume":"181","author":"T Bohman","year":"2010","unstructured":"Bohman, T., Keevash, P.: The early evolution of the H-free process. Invent. Math. 181(2), 291\u2013336 (2010)","journal-title":"Invent. Math."},{"key":"82_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.4153\/CMB-1971-028-8","volume":"14","author":"V Chv\u00e1tal","year":"1971","unstructured":"Chv\u00e1tal, V., Koml\u00f3s, J.: Some combinatorial theorems on monotonicity. Can. Math. Bull. 14, 151\u2013157 (1971)","journal-title":"Can. Math. Bull."},{"key":"82_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.jctb.2016.06.007","volume":"122","author":"D Conlon","year":"2017","unstructured":"Conlon, D., Fox, J., Lee, C., Sudakov, B.: Ordered Ramsey numbers. J. Comb. Theory Ser. B 122, 353\u2013383 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"6","key":"82_CR5","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1017\/S0963548321000067","volume":"30","author":"N Dragani\u0107","year":"2021","unstructured":"Dragani\u0107, N., Dross, F., Fox, J., Gir\u00e3o, A., Havet, F., Kor\u00e1ndi, D., Lochet, W., Munh\u00e1 Correia, D., Scott, A., Sudakov, B.: Powers of paths in tournaments. Comb. Probab. Comput. 30(6), 894\u2013898 (2021)","journal-title":"Comb. Probab. Comput."},{"key":"82_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1112\/jlms\/s1-25.4.249","volume":"1","author":"P Erd\u0151s","year":"1950","unstructured":"Erd\u0151s, P., Rado, R.: A combinatorial theorem. J. Lond. Math. Soc. 1, 249\u2013255 (1950)","journal-title":"J. Lond. Math. Soc."},{"key":"82_CR7","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"82_CR8","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1112\/plms\/pds018","volume":"105","author":"J Fox","year":"2012","unstructured":"Fox, J., Pach, J., Sudakov, B., Suk, A.: Erd\u0151s-Szekeres-type theorems for monotone paths and convex bodies. Proc. Lond. Math. Soc. 105, 953\u2013982 (2012)","journal-title":"Proc. Lond. Math. Soc."},{"key":"82_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M Golumbic","year":"2004","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, Amsterdam (2004)"},{"key":"82_CR10","doi-asserted-by":"crossref","unstructured":"K\u0151v\u00e1ri, P., S\u00f3s, V. T., Tur\u00e1n, P.: On a problem of Zarankiewicz. In: Colloquium Mathematicum, Vol. 3, pp. 50\u201357. Polska Akademia Nauk (1954)","DOI":"10.4064\/cm-3-1-50-57"},{"key":"82_CR11","first-page":"445","volume":"6","author":"K Milans","year":"2015","unstructured":"Milans, K., Stolee, D., West, D.: Ordered Ramsey theory and track representations of graphs. J. Comb. 6, 445\u2013456 (2015)","journal-title":"J. Comb."},{"key":"82_CR12","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/j.aim.2014.06.008","volume":"262","author":"G Moshkovitz","year":"2014","unstructured":"Moshkovitz, G., Shapira, A.: Ramsey theory, integer partitions and a new proof of the Erd\u0151s\u2013Szekeres theorem. Adv. Math. 262, 1107\u20131129 (2014)","journal-title":"Adv. Math."},{"key":"82_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ejc.2016.12.007","volume":"62","author":"D Mubayi","year":"2017","unstructured":"Mubayi, D.: Variants of the Erd\u0151s\u2013Szekeres and Erd\u0151s\u2013Hajnal Ramsey problems. Eur. J. Comb. 62, 197\u2013205 (2017)","journal-title":"Eur. J. Comb."},{"key":"82_CR14","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jctb.2017.03.002","volume":"125","author":"D Mubayi","year":"2017","unstructured":"Mubayi, D., Suk, A.: Off-diagonal hypergraph Ramsey numbers. J. Comb. Theory Ser. B 125, 168\u2013177 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"82_CR15","doi-asserted-by":"publisher","unstructured":"Mubayi, D., Suk, A.: A survey of hypergraph Ramsey problems. Discret. Math. Appl. (2020). https:\/\/doi.org\/10.1007\/978-3-030-55857-4_16","DOI":"10.1007\/978-3-030-55857-4_16"},{"key":"82_CR16","doi-asserted-by":"crossref","unstructured":"Mubayi, D., Suk, A.: Ramsey numbers of cliques versus monotone paths. ArXiv Preprint ArXiv:2303.16995 (2023)","DOI":"10.1016\/j.ejc.2024.103922"},{"key":"82_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1005210202899","volume":"81","author":"J Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Erd\u0151s\u2013Szekeres-type theorems for segments and noncrossing convex sets. Geom. Dedicata. 81, 1\u201312 (2000)","journal-title":"Geom. Dedicata."},{"key":"82_CR18","doi-asserted-by":"crossref","unstructured":"Sawin, W.: An improved lower bound for multicolor Ramsey numbers and a problem of Erd\u0151s. J. Comb. Theory Ser. A. 188, Paper No. 105579 (2022)","DOI":"10.1016\/j.jcta.2021.105579"},{"key":"82_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(77)90044-9","volume":"20","author":"J Spencer","year":"1977","unstructured":"Spencer, J.: Asymptotic lower bounds for Ramsey functions. Discret. Math. 20, 69\u201376 (1977)","journal-title":"Discret. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00082-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00082-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00082-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T10:07:12Z","timestamp":1716199632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00082-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00082-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"assertion":[{"value":"22 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}