Coloring the distance graphs

DOI10.1007/s40879-023-00665-6arXiv2201.00275MaRDI QIDQ6166628

Jindřich Zapletal

Publication date: 3 August 2023

Published in: European Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Solovay modelgeometric set theoryNoetherian topology

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• Can you take Solovay's inaccessible away?
• A Decomposition Theorem for R n
• Model Theory
• Set Theory
• Avoidable algebraic subsets of Euclidean space
• Geometric Set Theory
• On chromatic number of graphs and set-systems
• Krull dimension in set theory

This page was built for publication: Coloring the distance graphs