We address the following rainbow Ramsey problem: For posets P, Q what is the smallest number n such that any coloring of the elements of the Boolean lattice ...
確定! 回上一頁