Let $G$ be a finite unit distance graph in $\mamthbb{R}^2$. Is there some $k$ such that if $G$ has girth $≥ k$, then $\chi(G) ≤ 3$?

Erdős problem 705

Let $G$ be a finite unit distance graph in `Unparsed notation: \mamthbb{R}^2`. Is there some $k$ such that if $G$ has girth $≥ k$ , then $\chi(G) ≤ 3$ ?

1 of 6 recorded

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:0b51d9062543d1f71860af44012a4dfd5089a2eaa758e49ed8bb197c75fa24e0
Metadata: sha256:f6916ddc090fb742b9c3f0713d3acec64f131948fd8f1b06113026b1b00ea66d
Observation: sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content: sha256:4a3476747b918b4486247e1c5994fdf12750cf66c8e772a8e6d5c8832f3ab4fb

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit: 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb