Erdős problem 1007 · problems.science

The dimension of a graph $G$ is the minimal $n$ such that $G$ can be embedded in $\mathbb{R}^n$ such that every edge of $G$ is a unit line segment.

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Formalization
Erdős AI contributions wiki · 19 Jan, 2026
Machine
Aristotle
Open the source record
AI building on literature
Erdős AI contributions wiki · 19 Jan, 2026
Machine
Aristotle
Open the source record