The Hadwiger–Nelson Problem

DOI10.1007/978-3-319-32162-2_14zbMath1347.05081MaRDI QIDQ2827299

Alexander Soifer

Publication date: 18 October 2016

Published in: Open Problems in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32162-2_14

zbMATH Keywords

chromatic number; plane problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

On the chromatic number of an infinitesimal plane layer, Lower bounds for the measurable chromatic number of the hyperbolic plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• All regular polytopes are Ramsey
• The realization of distances in measurable subsets covering \(R^ n\).
• Intersection theorems with geometric consequences
• A six-coloring of the plane
• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• Another six-coloring of the plane
• The odd-distance plane graph
• A model of set-theory in which every set of reals is Lebesgue measurable
• Distances realized by sets covering the plane
• On the Nelson Unit Distance Coloring Problem
• The Mathematical Coloring Book
• Plane Sets with Positive Density at Infinity Contain all Large Distances
• Are There n + 2 Points in E n With Odd Integral Distances?
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space