A polarized partition relation using elementary substructures
The following polarized partition relation is proved. Let \(\kappa\) be an infinite cardinal, \(\lambda=\bigl(2^{<\kappa}\bigr)^+\), \(\alpha<\lambda\) an ordinal. If the Cartesian product \(\lambda\times\lambda\) is colored with colors 0 and 1 then either there is in color 0 a homogeneous set \(A\times B\) with \(A\) of type \(\alpha\), \(B\) of type \(\lambda\), or vice versa, or else there is in color 1 a homogeneous set \(A\times B\) with \(A\) and \(B\) both of type \(\kappa+1\). This extends earlier results of Erdős, Hajnal, and Rado. The proof uses elementary submodels.
- The use of elementary substructures in combinatorics
- Polarized partition relations
- On set systems having paradoxical covering properties
- Partitions of products
- Some results on polarized partion relations of higher dimension
- scientific article; zbMATH DE number 761286 (Why is no real title available?)
- Polarized relations at singulars over successors
This page was built for publication: A polarized partition relation using elementary substructures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2710592)
