I am mainly interested in extremal and probabilistic combinatorics. I also enjoy spectral graph theory and analysis. I’m a firm believer in the experimental side of theoretical mathematics. Much of my work is aided by code I write, especially in sage. You may also read my research statement and CV.

My dissertation work revolves around the edit distance problem. Informally we ask, “How much work is needed to remove a fixed graph from an arbitrary host graph?”. Stated differently, fix some graph F. What is the maximum proportion of edits (edge-additions and edge-deletion) that must be made to an arbitrary graph G to ensure that G contains no induced copy of F? I gave a talk at the USC Discrete Mathematics seminar on the case where the “fixed” graph F is an Erdős–Rényi random graph.

Research Papers