The sequence of prime gaps is graphic

Péter L. Erdős, Gergely Harcos, Shubha R. Kharel +3

Let us call a simple graph on $n\ge 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n…