Coloring grids
From MaRDI portal
Abstract: A structure where each is an equivalence relation on is called an -grid if any two equivalence classes coming from distinct 's intersect in a finite set. A function is an acceptable coloring if for all , the set intersects each -equivalence class in a finite set. If is a set, then the -cube may be seen as an -grid, where the equivalence classes of are the lines parallel to the -th coordinate axis. We use elementary submodels of the universe to characterize those -grids which admit an acceptable coloring. As an application we show that if an -grid does not admit an acceptable coloring, then every finite -cube is embeddable in .
Recommendations
Cites work
Cited in
(4)
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)