Coloring ${\mathbb R}^n$

DOI10.1090/S0002-9947-01-02881-1zbMath0982.03023OpenAlexW3043435228MaRDI QIDQ2759050

James H. Schmerl

Publication date: 10 December 2001

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-01-02881-1

zbMATH Keywords

graph coloringEuclidean spaces

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Partition relations (03E02)

Related Items (1)

Kaleidoscopical configurations

Cites Work

• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• A LATTICE-POINT PROBLEM OF STEINHAUS
• A Coloring Result for the Plane
• A Decomposition Theorem for R n
• Countable partitions of Euclidean space

This page was built for publication: Coloring ${\mathbb R}^n$