Coloring redundant algebraic hypergraphs

MaRDI QIDQ6357930zbMATH OpenFDO

Authors Jindřich Zapletal

Publication date 9 January 2021

Mathematics Subject Classification ID

Descriptive set theory (03E15) Axiom of choice and related propositions (03E25) Consistency and independence results (03E35)

Abstract: We prove several consistency results in choiceless set theory ZF+DC regarding countable chromatic numbers of various algebraic hypergraphs on Euclidean spaces.

This page was built for publication: Coloring redundant algebraic hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357930)