Dillon Mayhew

Research interests

Matroid theory, graph theory, computational complexity, cryptography and coding.


BMus (VUW), BA (Cantab.), BAHons (VUW), MA (VUW), DPhil (Oxon.)


Fellows: Rutherford Discovery Fellowship

About me

I studied music and mathematics alongside each other when I was a student. Mathematics won out eventually, but I still play music with orchestras around New Zealand.


My research is concentrated in matroid theory, which is type of abstract geometry. Over the years, I have enjoyed learning more about other fields of mathematics, including computability theory (the study of what computers are capable of doing), complexity theory (the study of what computers are capable of doing efficiently), model theory (the study of what formal languages are capable of expressing), and algebraic number theory.

Research groups

The VUW matroid theory research group.

Research grants

Marsden Fast-Start Grant (2009), Rutherford Discovery Fellowship (2014)

Personal website

Dillon Mayhew's website

Supervision interest

Matroid theory, combinatorics

I am happy to be approached by potential students.

Current Master and PhD students:

Meenu Mariya Jose, PhD - Well-quasi-ordering and axiomatisability

Past Master and PhD students:

Will Critchlow, PhD, 2017 – Randomness in classes of matroids

Xander Perrott, MSc, 2016 - Identically self-dual matroids

Kadin Prideaux, MSc, 2015 – Families of cyclic flats of matroids

Michael Welsh, PhD, 2014 – On maximum-sized golden-mean matroids

Amanda Cameron, MSc, 2013 – Kinser inequalities and related matroids

Michael Snook, PhD, 2013 – Matroids, complexity, and computation

Michael Welsh, MSc, 2011 – Golden-mean and secret sharing matroids

List of selected publications:

Please see website: