Coloring redundant algebraic hypergraphs

2021/01/09 by Jindřich Zapletal, Zapletal, Jindrich · 1 citation
Mathematics · #Advanced Topology and Set Theory #Mathematical and Theoretical Analysis #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2101.03437

Abstract

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

Cited by

• Noetherian spaces in choiceless set theory

Related

• Chromatic Numbers of Algebraic Hypergraphs
• Deciding the Chromatic Numbers of Algebraic Hypergrahs
• Transcendental pairs of generic extensions
• Coloring the distance graphs
• Coloring closed Noetherian graphs