{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:07:19Z","timestamp":1780744039080,"version":"3.54.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Motivated by the paper, Boolean lattices: Ramsey properties and embeddings\u00a0Order, 34 (2) (2017), of Axenovich and Walzer, we study the Ramsey-type problems on the Boolean lattices. Given posets $P$ and $Q$, we look for the smallest Boolean lattice $\\mathcal{B}_N$ such that any coloring of elements of $\\mathcal{B}_N$ must contain a monochromatic $P$ or a rainbow $Q$ as an induced subposet. This number $N$ is called the Boolean rainbow Ramsey number of $P$ and $Q$ in the paper.\r\nParticularly, we determine the exact values of the Boolean rainbow Ramsey number for $P$ and $Q$ being the antichains, the Boolean posets, or the chains. From these results, we also derive some general upper and lower bounds of the Boolean rainbow Ramsey number for general $P$ and $Q$ in terms of the poset parameters.<\/jats:p>","DOI":"10.37236\/9034","type":"journal-article","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:00:53Z","timestamp":1607158853000},"source":"Crossref","is-referenced-by-count":5,"title":["The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains"],"prefix":"10.37236","volume":"27","author":[{"given":"Hong-Bin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yen-Jen","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei-Tian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chia-An","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2020,11,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p38\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p38\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:00:54Z","timestamp":1607158854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i4p38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,27]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,10,2]]}},"URL":"https:\/\/doi.org\/10.37236\/9034","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,27]]},"article-number":"P4.38"}}