I am a PhD student in Combinatorics and Optimization at the University of Waterloo. I am interested in structural graph theory and matroid theory, and their applications. My advisor is Jim Geelen. I am from Atlanta, Georgia (near Peachtree) where I graduated from Georgia Tech with a B.S. in discrete mathematics.

- J. Davies and R. McCarty. Circle graphs are quadratically Chi-bounded. arXiv:1905.11578.
- R. McCarty, Y. Wang, and X. Yu. 7-Connected Graphs are 4-Ordered, submitted. arXiv:1808.05124.
- R. McCarty and R. Thomas. The Extremal Function for Bipartite Linklessly Embeddable Graphs, accepted,
*Combinatorica*. arXiv:1708.08439. - R. McCarty. The Extremal Function and Colin de Verdière Graph Parameter, The Electronic Journal of Combinatorics, Volume 25, Issue 2, 2018.

- The Grid Theorem for Rank-Width, SIAM Discrete Math, Denver, CO, 2018. (On joint work with Jim Geelen, O-joung Kwon, and Paul Wollan. Manuscript in preparation.)
- 8-Connected Graphs are 4-Ordered, SiGMa, Waterloo, ON, 2017. (On joint work with Yan Wang and Xingxing Yu.)
- The Extremal Function and Colin de Verdière Parameter, Cumberland Conference on Combinatorics, Graph Theory and Computing, Nashville, TN, 2017.
- Total Acquisition in Diameter Two Graphs, Joint Math Meetings, Seattle, WA, 2016. (This work was done as part of an REU with Anant Godbole.)