Erdős problem 705 · problems.science

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$ ?

Result history

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:4a3476747b918b4486247e1c5994fdf12750cf66c8e772a8e6d5c8832f3ab4fb

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207