I am a PhD candidate at Simon Fraser University advised by Bojan Mohar and Ladislav Stacho. My citizenship is USA. I plan to complete my PhD in the Winter of 2022.
My research in graph theory so far has focused mainly on graph coloring and games on graphs. However, my main research interests are the techniques I have used to approach these topics: graph decompositions, probabilistic techniques, and algebraic structures.
How many colors are necessary to color the Cartesian product of two graphs, even with interference from an adversary? Can a graph be list colored even while satisfying a certain number of coloring preferences at its vertices? Can an outerplanar graph always be colored so that no vertex can guess its own color correctly? These are all problems that I have approached by decomposing a graph into more well-behaved substructures. While many graphs appear difficult to attack directly, they become much easier to work with after they are broken down into smaller, simpler pieces.
Can a graph G be colored with k colors so that every two-colored subgraph is planar? Can G be colored so that a specific forbidden color pair is avoided at every edge? If G is a random edge-colored graph, does a rainbow path connect every vertex pair? These are the types of questions that I attack with the probabilistic method. To answer questions for fixed graphs, I use randomized approaches including the Lovász Local Lemma and entropy compression, and to answer questions for random graphs, I use a variety of probabilistic tools.
How many cops are necessary to capture a robber on a Cayley graph over an abelian group? Which graphs on n vertices require Θ(√n) cops to capture a robber? When is the covering graph of a reflexive tree lifted over a cyclic group Hamiltonian? These are all questions that I have investigated that have algebra at their core or that can be attacked with algebra. To answer these questions, I use a combination of tools from group theory, finite fields, and traditional graph theory.
Publications and preprints
Journal of Comb. Theory, Ser. B (2021).
With Bojan Mohar. Submitted to Random Structures and Algorithms (2021).
With Tomáš Masařík, Jana Novotná, and Ladislav Stacho. SIDMA (2021).
With Kevin Halasz and Ladislav Stacho. Graphs and Comb. (2021).
J. Graph Theory (2021).
With Tomáš Masařík and Ladislav Stacho. J. Graph Theory (2020).
Submitted to Disc. App. Math. (2020).
With Seyyed Aliasghar Hosseini, Bojan Mohar, and Stacho. J. Graph Theory (2021).
Elec. J. Comb. (2021).
With Seyyed Aliasghar Hosseini. Submitted to J. Comb. (2019).
With Seyyed Aliasghar Hosseini and Jérémie Turcotte. European J. Comb. (2021).
Discrete Mathematics (2019).
PhD., Mathematics, Simon Fraser University, GPA: 4.17/4.33
Thesis: Graph coloring with additional restrictions, advised by Bojan Mohar and Ladislav Stacho
MSc., Mathematics, Simon Fraser University, GPA: 4.13/4.33
Thesis: Cops and robbers on Cayley graphs and embedded graphs, advised by Ladislav Stacho
B.S., Mathematics, University of Kansas, GPA: 3.82/4.00
Sep 2020 - Present
Sep 2018 - Aug 2020
2012 - 2016