Coloring redundant algebraic hypergraphs
Jindrich Zapletal
TL;DR
This paper investigates the chromatic properties of algebraic hypergraphs in Euclidean spaces within choiceless set theory, establishing several consistency results about their countable chromatic numbers.
Contribution
It provides new consistency results in ZF+DC concerning the chromatic numbers of algebraic hypergraphs on Euclidean spaces.
Findings
Several consistency results for countable chromatic numbers
Application of choiceless set theory to hypergraph coloring
Advances understanding of algebraic hypergraph properties
Abstract
We prove several consistency results in choiceless set theory ZF+DC regarding countable chromatic numbers of various algebraic hypergraphs on Euclidean spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Mathematical and Theoretical Analysis · Limits and Structures in Graph Theory