Harborth's conjecture
id:
harborth-s-conjecture-199-9875731
title:
Harborth's conjecture
text:
In mathematics, Harborth's conjecture states that every planar graph has a planar drawing in which every edge is a straight segment of integer length. This conjecture is named after Heiko Harborth, and would strengthen Fáry's theorem on the existence of straight-line drawings for every planar graph. For this reason, a drawing with integer edge lengths is also known as an integral Fáry embedding. Despite much subsequent research, Harborth's conjecture remains unsolved.
brand slug:
wiki
category slug:
encyclopedia
description:
On graph drawing with integer edge lengths
original url:
https://en.wikipedia.org/wiki/Harborth%27s_conjecture
date created:
date modified:
2024-01-11T08:03:56Z
main entity:
{"identifier":"Q21002406","url":"https://www.wikidata.org/entity/Q21002406"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/7a/Integer_octahedral_graph.svg","width":495,"height":459}
fields total:
13
integrity:
15