I am a PhD student in the Department of Mathematics at Iowa State University. I work
with Ryan Martin. My research interests lie in extremal combinatorics. In particular,
I study Turán-type problems on partially ordered sets, induced saturation on
partially ordered sets, vertex-identifying codes, partition problems in graphs, and network science problems.
When I am not doing math I enjoy reading and taking long walks.
- An algebraic Monte-Carlo algorithm for the bipartite partition adjacency matrix
realization problem, with É. Czabarka, L. A. Székely, and Z. Toroczkai, submitted.
- Injective choosability of subcubic planar graphs with
with B. Brimkov, J. Edmond, R. Lazar, B. Lidický, and K. Messerschmidt,
340(10) 2538-2549, (2017).
A note on the size of N-free families, with R. R. Martin, Eur. J. Math. 3(2) 429-432, (2017). [Journal Copy]
- Propagation time for zero forcing on a graph,
with L. Hogben, M. Huynh, N. Kingsley, S. Meyer, and M. Young,
Discrete Applied Math.
160(13-14) 1994-2005, (2012).