On the chromatic number of subsets of the Euclidean plane (Q2441349): Difference between revisions

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