The sequence of prime gaps is graphic

Abstract

Let us call a simple graph on n 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, and in fact for every n 2 if we assume the Riemann hypothesis. Moreover, an infinite sequence of prime gap graphs can be generated by the so-called degree preserving growth process.