I study combinatorics, and my current research interests lie in Ramsey theory and zero forcing for graphs.
Blake Bates, Zhanar Berikkyzy, Nick Chiem, Gabriel Elvin, Risa Fines, Maja Lie, Hanna Mikulás, Isaac Reiter, and Kevin Zhou, Bounds for Rainbow-uncommon Graphs, Involve, 2025 (to appear).
Gabriel Elvin, Hajrudin Fejzić, and Youngsu Kim, On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three, Americal Mathematical Monthly, submitted February 2026 (under review), arXiv:2511.09391.
Gabriel Elvin, Alexis Gonzales, Alejandro Rodriguez, and Israel Wilbur, Bounds on Arithmetic Rainbow Ramsey Multiplicities, PUMP Journal of Undergraduate Research, submitted March 2025 (under review), arXiv:2601.05442.
Ryan Blair, Gabriel Elvin, Veronika Furst, Leslie Hogben, Nandita Sahajpal, and Tony W. H. Wong, Sharp bounds for product and sum throttling numbers, Graphs and Combinatorics, submitted November 2025 (under review), arXiv:2501.03472.
I started a combinatorics seminar in January 2023. It evolved into the Coyote on the Edge (COTE) seminar and in Fall 2025 yielded the work above: On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three.
The goal of this seminar is to spark interest in combinatorics research among undergraduates, graduate students, and faculty. We especially want to give students an accessible entrance to mathematics research.