Diverse beam search to find densest-known planar unit distance graphs

Peter Engel, Owen Hammond-Lee, Yiheng Su +2

This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of $n$ vertices using computer search. An unsolved problem of Paul Erdős…