English

Galvin's problem in higher dimensions

Logic 2022-04-06 v1 Combinatorics

Abstract

It is proved that for each natural number nn, if R=n\left| \mathbb{R} \right| = {\aleph}_{n}, then there is a coloring of [R]n+2{\left[ \mathbb{R} \right]}^{n+2} into 0{\aleph}_{0} colors that takes all colors on [X]n+2{\left[ X \right]}^{n+2} whenever XX is any set of reals which is homeomorphic to Q\mathbb{Q}. This generalizes a theorem of Baumgartner and sheds further light on a problem of Galvin from the 1970s. Our result also complements and contrasts with our earlier result saying that any coloring of [R]2{\left[ \mathbb{R} \right]}^{2} into finitely many colors can be reduced to at most 22 colors on the pairs of some set of reals which is homeomorphic to Q\mathbb{Q} when large cardinals exist.

Keywords

Cite

@article{arxiv.2204.01799,
  title  = {Galvin's problem in higher dimensions},
  author = {Dilip Raghavan and Stevo Todorcevic},
  journal= {arXiv preprint arXiv:2204.01799},
  year   = {2022}
}

Comments

6 pages, submitted

R2 v1 2026-06-24T10:37:38.019Z