  Let n>1 be a number. Let Gn be the hypergraph of all rectangles in an
n-dimensional Euclidean space. It is consistent that ZF+DC holds, the chromatic
number of Gn is countable, yet the chromatic number of Gn+1 is uncountable.
