Pacific Journal of Mathematics · 1980 · 32 citations · 24 references
Natural SciencesMathematicsNumber TheorySet TheoryCombinatorial Number TheoryCombinatorial Set TheoryOrdinal NumbersColoring Theorems
We prove: Theorem 1. The class of all ordinals has a square-free 3-coloring and a cube-free 2-coloring. Theorem 2 Every kth power-free ^-coloring of a can be extended to a maximal kth power-free ^-coloring of , for some X a' , where k,ne .
24