The Boolean rainbow Ramsey number of antichains, Boolean posets and chains (Q2213816)

Summary: Motivated by the paper of \textit{M. Axenovich} and \textit{S. Walzer} [Order 34, No. 2, 287--298 (2017; Zbl 1375.05262)], 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. Particularly, 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.