Minimal Polynomials for the Coordinates of the Harborth Graph
Eberhard H. -A. Gerbracht
Abstract
The Harborth graph is the smallest known example of a 4-regular planar unit-distance graph. In this paper we give an analytical description of the coordinates of its vertices for a particular embedding in the Euclidean plane. More precisely, we show, how to calculate the minimal polynomials of the coordinates of its vertices (with the help of a computer algebra system), and list those. Furthermore some algebraic properties of these polynomials, and consequences to the structure of the Harborth graph are determined.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.