On the chromatic number of subsets of the Euclidean plane

DOI10.1007/s00373-012-1249-9zbMath1292.05096OpenAlexW2074504646MaRDI QIDQ2441349

Yanyan Li

Publication date: 24 March 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1249-9

zbMATH Keywords

unit distance graphchromatic number of the planecoloring the plane

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance geometry (51K99) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On the chromatic numbers of rational spaces, On the chromatic number of an infinitesimal plane layer, Coloring distance graphs on the plane

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic number of the plane: the bounded case
• A lower bound on the number of unit distances between the vertices of a convex polygon
• All unit-distance graphs of order 6197 are 6-colorable
• The maximum number of unit distances in a convex \(n\)-gon
• Additive \(k\)-colorable extensions of the rational plane
• Multiplicities of interpoint distances in finite planar sets
• Distances realized by sets covering the plane
• The Mathematical Coloring Book
• Tearing a strip off the plane
• The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)