Skip to content

Erdős problem 1007

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

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:070ef390ed5cd6c7ef7b384a0834bf7fa62761a071712b5d72a6251bf2399d9c
Metadata
sha256:1ea2a2cfd5e475648b794c189ab19cf53ab18a9fd07ad82a879b0bd0abd80bf9
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:1c5aa43a5ed13f0bbae28c456c40a93ce169bc883de043e0643fca03c0d3e3e4
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb