...that¹

$2^(V)$ denotes the power set of $(V)$, i.e., the set of all the subsets of ${1,...,|V|}$.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... bits²

$4\log{n} + O(\log\log{n})$ bits suffice to store n, d, K, $\cL(x)$ in a self-delimiting way, which is bounded by $5\log{n}$ for n large enough.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...odd³

The Theorem was unfortunately mistyped in the original paper. Here, we give the correct statement.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...triangulated⁴

A plane graph where all the faces are triangles.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... $\item~{\bf\cite{KRS97_tmp}}$⁵

The original result presented in this article is $2$-$ dilation(multi-globe) 1.25D$. However in the construction given in the proof it appears that the number of intervals is 3. To our best knowledge we do not know whether it can be done with 2 intervals only.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... graph⁶

I.e., $E = \{ (A,B) \in V^2 \mid A \neq B \mbox{ and }A \cap B \neq \emptyset \}$.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.