Peter Bradshaw
About Me
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.
Graph decompositions
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 wellbehaved 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.
Probabilistic techniques
Can a graph G be colored with k colors so that every twocolored subgraph is planar? Can G be colored so that a specific forbidden color pair is avoided at every edge? If G is a random edgecolored 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.
Algebraic structures
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
1. On the hat guessing number and guaranteed subgraphs (2021).
2. On the hat guessing number of a planar graph class.
Journal of Comb. Theory, Ser. B (2021).
3. A rainbow connectivity threshold for random graph families.
With Bojan Mohar. Submitted to Random Structures and Algorithms (2021).
4. Robust Connectivity of Graphs on Surfaces.
With Tomáš Masařík, Jana Novotná, and Ladislav Stacho. SIDMA (2021).
5. From one to many rainbow Hamiltonian cycles.
With Kevin Halasz and Ladislav Stacho. Graphs and Comb. (2021).
6. Graph colorings with restricted bicolored subgraphs: II. The graph coloring game.
J. Graph Theory (2021).
7. Flexible List Colorings in Graphs with Special Degeneracy Conditions.
With Tomáš Masařík and Ladislav Stacho. J. Graph Theory (2020).
8. A note on the connected game coloring number.
Submitted to Disc. App. Math. (2020).
9. Cops and robbers on graphs of high girth.
With Seyyed Aliasghar Hosseini, Bojan Mohar, and Stacho. J. Graph Theory (2021).
10. Transversals and bipancyclicity in bipartite graph families.
Elec. J. Comb. (2021).
11. Surrounding cops and robbers on graphs of bounded genus.
With Seyyed Aliasghar Hosseini. Submitted to J. Comb. (2019).
12. Cops and robbers on directed and undirected abelian Cayley graphs.
With Seyyed Aliasghar Hosseini and Jérémie Turcotte. European J. Comb. (2021).
13. A proof of Meyniel’s conjecture for abelian Cayley graphs.
Discrete Mathematics (2019).
CV
Education
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