The Euclid-Mullin graph

Andrew R Booker, Sean Irvine

Research output: Contribution to journalArticle (Academic Journal)peer-review

3 Citations (Scopus)
274 Downloads (Pure)


We introduce the Euclid–Mullin graph, which encodes all instances of Euclid’s proof of the infinitude of primes. We investigate structural properties of the graph both theoretically and numerically; in particular, we prove that it is not a tree.
Original languageEnglish
Pages (from-to)30-57
Number of pages28
JournalJournal of Number Theory
Early online date4 Mar 2016
Publication statusPublished - Aug 2016


  • Prime numbers
  • Euclid–Mullin sequence


Dive into the research topics of 'The Euclid-Mullin graph'. Together they form a unique fingerprint.

Cite this