Boolean lattices: Ramsey properties and embeddings (Q2407683): Difference between revisions

\(R(m,n)\) is the least \(k\) such that if the subsets of \(k\) are colored red or blue, then either there is a subset of \(\mathrm{Pow}(k)\) isomorphic with respect to inclusion to \(\mathrm{Pow}(m)\) with all members colored red, or there is one isomorphic to \(\mathrm{Pow}(n)\) with all members colored blue. The authors prove several results about this notion. The simplest ones are: \(P(1,n)=n+1\); \(P(2,n)\leq 2n+2\); \(n+m\leq R(m,n)\leq mn+n+m\); \(R(2,2)=4\); \(R(3,3)\in\{7,8\}\). They also give an asymptotic Ramsey result involving choosing colors randomly with equal probabilities. Using \(k\geq2\) colors is also considered, as well as a generalization to Boolean algebras.