2022 (with Paweł Prałat and Trent G. Marbach). “Tight bounds on probabilistic zero forcing on hypercubes and grids”. Electronic Journal of Combinatorics 29.1, Paper 1.3. [arXiv]

2022 (with Robert Johnson). “Synchronizing times for k-sets in automata”. Electronic Journal of Combinatorics 29.3, Paper 3.41. [arXiv]

2023 (with Anthony Bonato, Melissa A. Huggan, Rehan Malik, and Trent G. Marbach). “The iterated local transitivity model for hypergraphs”. Discrete Applied Mathematics 337, pp. 106-119. [arXiv]

2022 (with Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, and Brittany Pittman). “The localization capture time of a graph”. Theoretical Computer Science 911, pp.80-91. [arXiv]

2019. “Semi-perfect 1-factorizations of the hypercube”. Discrete Mathematics 342.6, pp. 1696-1702. [arXiv]

2018. “Hypergraph saturation irregularities”. Electronic Journal of Combinatorics 25.2, Paper 2.11. [arXiv]


(with Natasha Morrison and Jonathan A. Noel). “Common pairs of graphs”.

(with Natasha Morrison and Jonathan A. Noel). “Off-diagonal commonality of graphs via entropy”.

(with Gabriel Crudele, Jonathan A. Noel and Lina M. Simbaqueba). Sidorenko-type inequalities for pairs of trees.

(with Akina Kuperus, Natasha Morrison and Ashna Wright). Improved bounds for cross-Sperner systems.

(with Tom Johnston, Shoham Letzter and Natasha Morrison, Shannon Ogden). The rainbow saturation number is linear.

(with Paweł Prałat, Trent Marbacht and Andrzej Ruciński). “Subgraph games in the semi-random graph process and its generalization to hypergraphs”.

See also: all arXiv versions

See also: Documents for PhD thesis and more

See also: Co-authors