---

I am a graduate student pursuing a PhD in mathematics at the University of Vermont. In December 2017 I recieved a Bachelors of Arts in Mathematics and English, also from UVM. For a year, I taught English language courses at two middle schools near Nantes, France. I thoroughly enjoy my research in graph theory and my role as a graduate student instructor.

My research primarily concerns combinatorial graph theory. I am interested in other areas of combinatorics too, including extremal problems and matroid theory. This year, I am applying these skills to a project on satellite communication networks as a Graduate Research Assistant.

CV (PDF)»

---

Research

Path odd-covers of graphs, Steffen Borgwardt, CB, Eric Culver, Bryce Frederickson, Puck Rombach, and Youngho Yoo; arXiv:2306.06487, 2023.

Odd covers of graphs, CB, Alexander Clifton, Eric Culver, Jiaxi Nie, Jason O'Neill, Puck Rombach, and Mei Yin; J. Graph Theory, 2023.

On the last new vertex visited by a random walk in a directed graph, CB, Paul Horn, and Puck Rombach; Discrete Math. Lett., 11:96-98, 2023.

Toughness of recursively partitionable graphs, CB, Brandon Du Preez, K. E. Perry, and Puck Rombach; arXiv:2210.10590, 2022.

Subgraph complementation and minimum rank, CB, Christopher Purcell, Puck Rombach; Electr. J. Comb., 29(1), Feb 2022.

---

Talks and Posters

List of talks upcoming and previously given talks

Slides on the last new vertex visited by a random walk in a directed graph, for the 54th SEICCGTC

Slides on subgraph complementation and minimum rank, and a poster for the 2021 NE Combinatorics Network KLATCH

Poster on odd covers of graphs for the 2022 Discrete Math Days

---

Teaching

Math019 Fundamentals of Calculus I (Fall 2019, 2020, & 2021)

• Lesson plans: an intuitive approach to calculating Riemann sums and integration by substitution

Math017 Applications of Finite Math (Spring 2020 & 2021)

---

Advisor

Ph.D. Dr. Puck Rombach, Assistant Professor at the University of Vermont

---

Outreach

Lessons designed to make combinatorics acccessible to a large audience.

Lights Out Can you turn off all the lights? Exercises range from simple to challenging.

Eventown and Oddtown How many (odd/even) clubs can we form if any two clubs must share an even number of people?

---

Links

Youtube lectures Video lectures from Spring 2020 Math017 Applications of Finite Math.

---

Awards and Honors

Nam Sang Kil Scholarship in Mathematics UVM (2023)

GTA Graduate Teaching Assistant of the Year, Lecture Instruction Category, UVM (2021)

Kenney John F. Kenney Award for excellence in mathematics, UVM (2021)

AMS American Mathematical Society Travel Grant, Joint Mathematics Meetings (2021)

Phi Beta Kappa Alpha of Vermont, UVM (2017)

---

Contact

---