I am interested in extremal combinatorics and graph theory. Recently, I am especially interested in graph coloring and Ramsey-type problems. I am being advised by Dr. Shira Zerbib (Iowa State University) and Dr. Emily Heath (Cal Poly Pomona).
Publications and Preprints
E. Heath, G. McCourt, A. Parker, C. Schwieder, S. Zerbib. Ramsey Numbers in Kneser Graphs. arXiv.
N. Crawford, E. Heath, O. Henderschedt, C. Schwieder, and S. Zerbib. Odd Ramsey numbers of multipartite graphs and hypergraphs. Submitted.
D. Baker, E. Gomez-Leos, A. Halfpap, E. Heath, R. R. Martin, J. Miller, A. Parker, H. Pungello, C. Schwieder, and N. Veldt. On the proper rainbow saturation numbers of cliques, paths, and odd cycles. Submitted.
J. Briggs, A. Parker, C. Schwieder, and C. Wells. Frogs, hats and common subsequences. Submitted.
E. Gomez-Leos, E. Heath, A. Parker, C. Schwieder, and S. Zerbib. New bounds on the generalized Ramsey number f(n,5,8). Discrete Mathematics. 347(7) (2024).
G. Aspenson, D. Baker, B. Freyberg, and C. Schwieder. Decomposing K_{18n} and K_{18n+1} into connected unicyclic graphs with nine edges. Electronic Journal of Graph Theory and Applications, 11(1) (2023).
Me explaining my proposed research problem at the 2024 Graduate Research Workshop in Combinatorics (GRWC)
Enrique Gomez-Leos, Emily Heath, Alex Parker, me, and Shira Zerbib during a poster on f(n,5,8)