Coloring triangles and rectangles

DOI10.14712/1213-7243.2023.020MaRDI QIDQ6178008zbMATH OpenFDO

Authors Jindřich Zapletal

Publication date 18 January 2024

Published in Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.09845

zbMATH Keywords

algebraic hypergraphchromatic numberconsistency resultgeometric set theoryreal algebraic geometry

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Real algebraic and real-analytic geometry (14P99)

Abstract: It is consistent that ZF+DC holds, the hypergraph of rectangles on a given Euclidean space has countable chromatic number, while the hypergraph of equilateral triangles in two-dimensional Euclidean space does not.

Cites work

• Avoidable algebraic subsets of Euclidean space
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• Geometric Set Theory
• scientific article; zbMATH DE number 3300442 (Why is no real title available?)
• Model Theory
• On non-denumerable graphs
• Set Theory
• Souslin forcing

Cited in

(1)

• Coloring isosceles triangles in choiceless set theory

This page was built for publication: Coloring triangles and rectangles

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