Papex

Open problem · Mathematics · since 1987 · Open

Harborth’s conjecture

Can every planar graph be drawn without crossings using straight edges whose lengths are all whole numbers?

Summary

The conjecture is named after Heiko Harborth and would strengthen Fáry’s theorem that every planar graph has a straight-line drawing. It has been proved for several special classes of planar graphs, and a positive answer to the Erdős–Ulam problem would imply it.

Source

Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics