{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:23:56Z","timestamp":1757312636579},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","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":"Karlsruher Institut f\u00fcr Technologie (KIT)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2024,8]]},"abstract":"Abstract<\/jats:title>Given partially ordered sets (posets) $$(P, \\le _P)$$<\/jats:tex-math>\n \n (<\/mml:mo>\n P<\/mml:mi>\n ,<\/mml:mo>\n \n \u2264<\/mml:mo>\n P<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$(P', \\le _{P'})$$<\/jats:tex-math>\n \n (<\/mml:mo>\n \n P<\/mml:mi>\n \u2032<\/mml:mo>\n <\/mml:msup>\n ,<\/mml:mo>\n \n \u2264<\/mml:mo>\n \n P<\/mml:mi>\n \u2032<\/mml:mo>\n <\/mml:msup>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, we say that $$P'$$<\/jats:tex-math>\n \n P<\/mml:mi>\n \u2032<\/mml:mo>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> contains a copy of P<\/jats:italic> if for some injective function $$f:P\\rightarrow P'$$<\/jats:tex-math>\n \n f<\/mml:mi>\n :<\/mml:mo>\n P<\/mml:mi>\n \u2192<\/mml:mo>\n \n P<\/mml:mi>\n \u2032<\/mml:mo>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and for any $$A, B\\in P$$<\/jats:tex-math>\n \n A<\/mml:mi>\n ,<\/mml:mo>\n B<\/mml:mi>\n \u2208<\/mml:mo>\n P<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, $$A\\le _P B$$<\/jats:tex-math>\n \n A<\/mml:mi>\n \n \u2264<\/mml:mo>\n P<\/mml:mi>\n <\/mml:msub>\n B<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> if and only if $$f(A)\\le _{P'} f(B)$$<\/jats:tex-math>\n \n f<\/mml:mi>\n \n (<\/mml:mo>\n A<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n \n \u2264<\/mml:mo>\n \n P<\/mml:mi>\n \u2032<\/mml:mo>\n <\/mml:msup>\n <\/mml:msub>\n f<\/mml:mi>\n \n (<\/mml:mo>\n B<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. For any posets P<\/jats:italic> and Q<\/jats:italic>, the poset Ramsey number R<\/jats:italic>(P<\/jats:italic>,\u00a0Q<\/jats:italic>) is the least positive integer N<\/jats:italic> such that no matter how the elements of an N<\/jats:italic>-dimensional Boolean lattice are colored in blue and red, there is either a copy of P<\/jats:italic> with all blue elements or a copy of Q<\/jats:italic> with all red elements. We focus on the poset Ramsey number $$R(P, Q_n)$$<\/jats:tex-math>\n \n R<\/mml:mi>\n (<\/mml:mo>\n P<\/mml:mi>\n ,<\/mml:mo>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for a fixed poset P<\/jats:italic> and an n<\/jats:italic>-dimensional Boolean lattice $$Q_n$$<\/jats:tex-math>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, as n<\/jats:italic> grows large. It is known that $$n+c_1(P) \\le R(P,Q_n) \\le c_2(P) n$$<\/jats:tex-math>\n \n n<\/mml:mi>\n +<\/mml:mo>\n \n c<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n \n (<\/mml:mo>\n P<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n \u2264<\/mml:mo>\n R<\/mml:mi>\n \n (<\/mml:mo>\n P<\/mml:mi>\n ,<\/mml:mo>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n \u2264<\/mml:mo>\n \n c<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n \n (<\/mml:mo>\n P<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for positive constants $$c_1$$<\/jats:tex-math>\n \n c<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$c_2$$<\/jats:tex-math>\n \n c<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. However, there is no poset P<\/jats:italic> known, for which $$R(P, Q_n)> (1+\\epsilon )n$$<\/jats:tex-math>\n \n R<\/mml:mi>\n \n (<\/mml:mo>\n P<\/mml:mi>\n ,<\/mml:mo>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n ><\/mml:mo>\n \n (<\/mml:mo>\n 1<\/mml:mn>\n +<\/mml:mo>\n \u03f5<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for $$\\epsilon >0$$<\/jats:tex-math>\n \n \u03f5<\/mml:mi>\n ><\/mml:mo>\n 0<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. This paper is devoted to a new method for finding upper bounds on $$R(P, Q_n)$$<\/jats:tex-math>\n \n R<\/mml:mi>\n (<\/mml:mo>\n P<\/mml:mi>\n ,<\/mml:mo>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> using a duality between copies of $$Q_n$$<\/jats:tex-math>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and sets of elements that cover them, referred to as blockers. We prove several properties of blockers and their direct relation to the Ramsey numbers. Using these properties we show that $$R(\\mathcal {N},Q_n)=n+\\Theta (n\/\\log n)$$<\/jats:tex-math>\n \n R<\/mml:mi>\n \n (<\/mml:mo>\n N<\/mml:mi>\n ,<\/mml:mo>\n \n Q<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n =<\/mml:mo>\n n<\/mml:mi>\n +<\/mml:mo>\n \u0398<\/mml:mi>\n \n (<\/mml:mo>\n n<\/mml:mi>\n \/<\/mml:mo>\n log<\/mml:mo>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for a poset $$\\mathcal {N}$$<\/jats:tex-math>\n N<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with four elements A<\/jats:italic>,\u00a0B<\/jats:italic>,\u00a0C<\/jats:italic>,\u00a0 and D<\/jats:italic>, such that $$A<C$$<\/jats:tex-math>\n \n A<\/mml:mi>\n <<\/mml:mo>\n C<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, $$B<D$$<\/jats:tex-math>\n \n B<\/mml:mi>\n <<\/mml:mo>\n D<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, $$B<C$$<\/jats:tex-math>\n \n B<\/mml:mi>\n <<\/mml:mo>\n C<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and the remaining pairs of elements are incomparable.<\/jats:p>","DOI":"10.1007\/s11083-024-09663-z","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T06:02:21Z","timestamp":1709100141000},"page":"401-418","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Poset Ramsey Number $$R(P,Q_n)$$. II. N-Shaped Poset"],"prefix":"10.1007","volume":"41","author":[{"given":"Maria","family":"Axenovich","sequence":"first","affiliation":[]},{"given":"Christian","family":"Winter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,28]]},"reference":[{"issue":"2","key":"9663_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11083-016-9399-7","volume":"34","author":"M Axenovich","year":"2017","unstructured":"Axenovich, M., Walzer, S.: Boolean lattices: Ramsey properties and embeddings. Order 34(2), 287\u2013298 (2017)","journal-title":"Order"},{"key":"9663_CR2","doi-asserted-by":"crossref","unstructured":"Axenovich, M., Winter, C.: Poset Ramsey numbers: large Boolean lattice versus a fixed poset. Combinatorics, Probability and Computing pp.\u00a01\u201316 (2023)","DOI":"10.1017\/S0963548323000032"},{"key":"9663_CR3","doi-asserted-by":"crossref","unstructured":"Bohman, T., Peng, F.: A construction for boolean cube ramsey numbers. Order (2022)","DOI":"10.1007\/s11083-022-09613-7"},{"key":"9663_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11083-008-9090-8","volume":"25","author":"T Carroll","year":"2008","unstructured":"Carroll, T., Katona, G.: Bounds on maximal families of sets not containing three sets with $$A \\cap B \\subset C$$, $$A \\lnot \\subset B$$. Order 25, 229\u2013236 (2008)","journal-title":"Order"},{"key":"9663_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s11083-021-09581-4","volume":"39","author":"F-H Chang","year":"2022","unstructured":"Chang, F.-H., Gerbner, D., Li, W.-T., Methuku, A., Nagy, D., Patk\u00f3s, B., Vizer, M.: Rainbow Ramsey problems for the Boolean lattice. Order 39, 453\u2013463 (2022)","journal-title":"Order"},{"key":"9663_CR6","unstructured":"Chen, H.-B., Chen, W.-H., Cheng, Y.-J., Li, W.-T., Liu, C.-A.: Ramsey properties for V-shaped posets in the boolean lattices. Preprint, available at arXiv:2108.08033v1, (2021)"},{"key":"9663_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H.-B., Cheng, Y.-J., Li, W.-T., Liu, C.-A.: The boolean rainbow ramsey number of antichains. boolean posets and chains. Electronic Journal of Combinatorics 27(4), (2020)","DOI":"10.37236\/9034"},{"issue":"3","key":"9663_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s11083-017-9449-9","volume":"35","author":"C Cox","year":"2018","unstructured":"Cox, C., Stolee, D.: Ramsey numbers for partially-ordered sets. Order 35(3), 557\u2013579 (2018)","journal-title":"Order"},{"key":"9663_CR9","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., Gallai, T., Tuza, Zs.: Covering the cliques of a graph with vertices. Discrete Math.108, 279\u2013289, 1992","DOI":"10.1016\/0012-365X(92)90681-5"},{"issue":"4","key":"9663_CR10","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1002\/rsa.20952","volume":"57","author":"V Falgas-Ravry","year":"2020","unstructured":"Falgas-Ravry, V., Markstr\u00f6m, K., Treglown, A., Zhao, Y.: Existence thresholds and Ramsey properties of random posets. Random. Struct. Algor. 57(4), 1097\u20131133 (2020)","journal-title":"Random. Struct. Algor."},{"issue":"2","key":"9663_CR11","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1112\/blms.12767","volume":"55","author":"D Gr\u00f3sz","year":"2023","unstructured":"Gr\u00f3sz, D., Methuku, A., Tompkins, C.: Ramsey numbers of Boolean lattices. Bull. Lond. Math. Soc. 55(2), 914\u2013932 (2023)","journal-title":"Bull. Lond. Math. Soc."},{"key":"9663_CR12","doi-asserted-by":"crossref","unstructured":"Keszegh, B., Lemons, N., Martin, R.R., P\u00e1lv\u00f6lgyi, D., Patk\u00f3s, B.: Induced and non-induced poset saturation problems. Journal of Combinatorial Theory, Series A (2021)","DOI":"10.1016\/j.jcta.2021.105497"},{"key":"9663_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcta.2015.06.002","volume":"136","author":"L Lu","year":"2015","unstructured":"Lu, L., Milans, K.: Set families with forbidden subposets. J. Comb. Theory Ser. 136, 126\u2013142 (2015)","journal-title":"J. Comb. Theory Ser."},{"key":"9663_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11083-021-09557-4","volume":"39","author":"L Lu","year":"2022","unstructured":"Lu, L., Thompson, C.: Poset Ramsey Numbers for Boolean Lattices. Order 39, 171\u2013185 (2022)","journal-title":"Order"},{"key":"9663_CR15","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.jcta.2017.11.002","volume":"155","author":"A M\u00e9roueh","year":"2018","unstructured":"M\u00e9roueh, A.: A LYM inequality for induced posets. J. Comb. Theory Ser. A 155, 398\u2013417 (2018)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"9663_CR16","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1017\/S0963548317000013","volume":"26","author":"A Methuku","year":"2017","unstructured":"Methuku, A., P\u00e1lv\u00f6lgyi, D.: Forbidden hypermatrices imply general bounds on induced forbidden subposet problems. Comb. Probab. Comput. 26(4), 593\u2013602 (2017)","journal-title":"Comb. Probab. Comput."},{"key":"9663_CR17","doi-asserted-by":"crossref","unstructured":"Methuku, A., Tompkins, C.: Exact forbidden subposet results using chain decompositions of the cycle. Electronic Journal of Combinatorics 22(4), (2015)","DOI":"10.37236\/4803"},{"key":"9663_CR18","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/j.jcta.2018.09.008","volume":"161","author":"I Tomon","year":"2019","unstructured":"Tomon, I.: Forbidden induced subposets of given height. J. Comb. Theory Ser. A 161, 537\u2013562 (2019)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9663_CR19","unstructured":"Valdes, J.: Parsing flowcharts and series-parallel graphs. Technical report STAN-CS-78-682, Computer Science Department, Stanford University, Stanford (1978)"},{"key":"9663_CR20","unstructured":"Walzer, S.: Ramsey Variant of the 2-Dimension of Posets. In: Master Thesis, karlsruhe institute of technology (2015)"},{"key":"9663_CR21","doi-asserted-by":"crossref","unstructured":"Winter, C.: Poset Ramsey number R(P, Qn). I. Complete multipartite posets. Order (2023)","DOI":"10.1007\/s11083-023-09636-8"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-024-09663-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11083-024-09663-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-024-09663-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T09:12:39Z","timestamp":1726218759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11083-024-09663-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["9663"],"URL":"https:\/\/doi.org\/10.1007\/s11083-024-09663-z","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"assertion":[{"value":"30 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing of interest"}}]}}