Publication at Faculty of Mathematics and Physics |
2003
Abstract
We show that whenever we color the finite subsets of N with arbitrarily many colors, we find a canonically colored arithmetic copy of an omega-forest. The five types of the canonical coloring are determined.