Heiko Harborth

Harborth has been an instructor or professor at Braunschweig University of Technology since studying there and receiving his PhD in 1965 under Hans-Joachim Kanold.

[3] Harborth is a member of the New York Academy of Sciences, Braunschweigische Wissenschaftliche Gesellschaft, the Institute of Combinatorics and its Applications, and many other mathematical societies.

Harborth currently sits on the editorial boards of Fibonacci Quarterly, Geombinatorics, Integers: Electronic Journal of Combinatorial Number Theory.

[6] Harborth's conjecture[7] posits that every planar graph admits a straight-line embedding in the plane where every edge has integer length.

This open question (as of 2014[update]) is a stronger version of Fáry's theorem.