The dimension of a graph $G$ is the minimal $n$ such that $G$ can be embedded in $R^{n}$ such that every edge of $G$ is a unit line segment.What is the smallest number of edges in a graph with dimension $4$ ?

unreviewedOpen. Worked here; no verified result yet.

graph theory · solved · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

Connections1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Search Vela