Dr. Rachel Kirsch

Assistant Professor

Department of Mathematical Sciences

George Mason University

rkirsch4 at gmu.edu

I am an Assistant Professor in the Department of Mathematical Sciences at George Mason University. My research is in combinatorics and graph theory, especially enumerative and extremal graph theory, combinatorics on words, universal cycles, and crossing numbers.

- R. Kirsch and J. Nir. "A localized approach to generalized Turán problems."
**Electronic Journal of Combinatorics**, to appear. - R. Kirsch, C. Sibley, and E. Sprangel. "Graph universal cycles: compression and connections to universal cycles."
**Advances in Applied Mathematics**, 2023. [arXiv] - R. Kirsch and J. Radcliffe. "Many cliques in bounded-degree hypergraphs."
**SIAM Journal on Discrete Mathematics**, 2023. [arXiv] - R. Kirsch, B. Lidický, C. Sibley, and E. Sprangel. "Shortened universal cycles for permutations."
**Discrete Applied Mathematics**, 2023. [arXiv] - C. Camacho, S. Fernández-Merchant, M. Jelić Milutinović, R. Kirsch, L. Kleist, E. Matson, and J. White. "Bounding the tripartite-circle crossing number of complete tripartite graphs."
**Journal of Graph Theory**, 2022. [arXiv] - G. Araujo-Pardo, Z. Berikkyzy, J. Faudree, K. Hogenson, R. Kirsch, L. Lesniak, and J. McDonald. "Finding long cycles in balanced tripartite graphs: a first step." In D. Ferrero et al. (eds),
**Research Trends in Graph Theory and Applications**, Association for Women in Mathematics Series (Volume 25), 2021. - R. Kirsch and A. J. Radcliffe. "Many cliques with few edges."
**Electronic Journal of Combinatorics**, 2021. [arXiv] - R. Kirsch and A. J. Radcliffe. "Maximizing the density of
*K*'s in graphs of bounded degree and clique number."_{t}**Discrete Mathematics**, 2020. [arXiv] - R. Kirsch and A. J. Radcliffe. "Many triangles with few edges."
**Electronic Journal of Combinatorics**, 2019. [arXiv] - B. Bjorkman, G. Cochran, W. Gao, L. Keough, R. Kirsch, M. Phillipson, D. Rorabaugh, H. Smith, and J. Wise. "
*k*-Foldability of words."**Discrete Applied Mathematics**, 2019. [arXiv] - K. Boyer, B. Brimkov, S. English, D. Ferrero, A. Keller, R. Kirsch, M. Phillips, and C. Reinhart. "The zero forcing polynomial of a graph."
**Discrete Applied Mathematics**, 2019. [arXiv] - B. Goeckner, C. Groothuis, C. Hettle, B. Kell, P. Kirkpatrick, R. Kirsch, and R. Solava. "Universal partial words over non-binary alphabets."
**Theoretical Computer Science**, 2018. [arXiv] - F. Blanchet-Sadri, M. Cordier, and R. Kirsch. "Border correlations, lattices, and the subgraph component polynomial."
**European Journal of Combinatorics**, 2018. - T. Feng, R. Kirsch, E. Villela, and M. Wage. "Birth-death processes and
*q*-continued fractions."**Transactions of the American Mathematical Society**, 2012.

- D. Fillmore, B. Goeckner, R. Kirsch, K. Martin, and D. McGinnis. "The existence and structure of universal partial cycles."
- A. Dawkins and R. Kirsch. "Hamiltonicity and related properties in
*K*-free graphs."_{r+1} - C. Camacho, S. Fernández-Merchant, M. Jelić Milutinović, R. Kirsch, L. Kleist, E. Matson, and J. White. "The tripartite-circle crossing number of graphs with two small partition classes."