On the Harborth Conjecture. Part I

Abstract

Harborth's conjecture states that every planar graph has a crossing-free straight-line drawing in which every edge has an integer length. Kleber's strengthening asks for the vertices themselves to have integer coordinates. In this series of papers, we make progress towards settling these conjectures. We reduce Kleber's conjecture to local rational-distance statements for special polygons with at most five vertices. The triangle case is known from the results of Almering and Berry. In this paper, we prove the existence of a rational-distance point on an interior integer diagonal in all the cases for non-degenerate quadrilaterals. In the upcoming papers, we focus on non-degenerate pentagons and then degenerate quadrilaterals and degenerate pentagons.