On Proper Colorings of Functions
From MaRDI portal
Abstract: We investigate the infinite version of -switch problem of Greenwell and Lov'asz. Given infinite cardinals and , for functions we say that they are totally different if for each . A function is a proper coloring if whenever and are totally different elements of . We say that (i) is weakly uniform iff there are pairwise totally different functions such that ; (ii) is tight if there is no proper coloring such that there is exactly one with . We show that given a proper coloring , the following statements are equivalent (i) is weakly uniform, (ii) there is a complete ultrafilter on an there is a permutation such that for each we have F(x)={pi}({alpha}) Longleftrightarrow {iin {lambda}: x(i)={alpha}} in mathscr{U}. We also show that there are tight proper colorings which can not be obtain such a way.
This page was built for publication: On Proper Colorings of Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417780)