Coloring grids

From MaRDI portal



Abstract: A structure mathcalA=left(A;Eiight)iinn where each Ei is an equivalence relation on A is called an n-grid if any two equivalence classes coming from distinct Ei's intersect in a finite set. A function chi:Aon is an acceptable coloring if for all iinn, the set chi−1(i) intersects each Ei-equivalence class in a finite set. If B is a set, then the n-cube Bn may be seen as an n-grid, where the equivalence classes of Ei are the lines parallel to the i-th coordinate axis. We use elementary submodels of the universe to characterize those n-grids which admit an acceptable coloring. As an application we show that if an n-grid mathcalA does not admit an acceptable coloring, then every finite n-cube is embeddable in mathcalA.












This page was built for publication: Coloring grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939947)