Ryan Martin

I am a professor at Iowa State University and currently a Scott Hanna Professor. I am Editor-in-Chief of the journal Order, published by Springer. My research is partially supported by a grant from the Simons Foundation (#709641, 2020-2025). My fields of interest are extremal poset theory, graph theory and extremal and probabilistic combinatorics.

• My research is partially supported by a grant from the Simons Foundation (#709641, 2020-2025)
• I received an award from the Distinguished Guest Fellowship Programme in Hungary by the Hungarian Academy of Sciences (MTA) and was based at the Alfréd Rényi Institute of Mathematics in Budapest from July 2023 through January 2024.
• I was a visitor of Maria Axenovich at the Karlsruhe Institute of Technology, Germany via the German Academic Exchange Service (DAAD) from January to March 2020.
• I was a Fulbright US Scholar as part of the Budapest Semesters in Mathematics program at the Alfred Rényi Institute of Mathematics from September to December 2019.
• I was a scholar-in-residence at the Institute for Mathematics and its Applications (IMA) at the University of Minnesota for the Thematic Year on Discrete Structures from August 2014 to May 2015.

Latest preprints:

• Tiling randomly perturbed multipartite graphs, with E. Gomez-Leos, submitted.
• Tiling randomly perturbed bipartite graphs, with E. Gomez-Leos, submitted.
• On the proper rainbow saturation numbers of cliques, paths, and odd cycles, with D. Baker, E. Gomez-Leos, A. Halfpap, E. Heath, J. Miller, A. Parker, H. Pungello, C. Schwieder, N. Veldt, submitted.
• On a generalization of a result of Kleitman, with B. Patkós, submitted.
• B-colorings of planar and outerplanar graphs, with M. Ruszinkó, and G.N. Sárközy, submitted.

• Induced saturation of the poset 2C₂, with N. Veldt, Ann. Comb., to appear.
• On the rainbow planar Turán number of paths, with E. Gyõri, A. Paulos, C. Tompkins, and K. Varga, Discrete Math. 348, (2025), no. 10, Article No. 114523. [Journal Link]
• A note on the Erdős matching conjecture, with B. Patkós, Studia Sci. Math. Hungar. 62, (2025), no. 1, 63--69. [Journal Link]
• Saturation of k-chains in the Boolean lattice, with N. Veldt, Electron. J. Combin. 32, (2025), no. 1, P1.55 (13pp.) [Journal Link]
• The maximum number of odd cycles in a planar graph, with E. Heath and C. Wells, J. Graph Theory 108, (2025), no. 4, 745-780. [Journal Link].
• On graphs embeddable in a layer of a hypercube and their extremal numbers, with M. Axenovich and C. Winter, Ann. Comb. 28 (2024), 1257-1283. [Journal Link].
• Proper edge colorings of planar graphs with rainbow C₄-s, with A. Gyárfás, M. Ruszinkó, and G.N. Sárközy, J. Graph Theory 107, (2024), no. 4, 833-846. [Journal Link].

Publications (PDF)

Teaching:

• Spring 2025: M5680: Enumerative Combinatorics and Ordered Sets
  • Time/Room: MWF 9:55-10:45, Carver 0190
  • Textbook: Class notes
  • Canvas:  https://canvas.iastate.edu
• Fall 2025-Spring 2026: On leave

Other materials:

• Edit distance survey: The edit distance in graphs: methods, results and generalizations, Recent Trends in Combinatorics, 31--62, IMA Vol. Math. Appl., 159, Springer, Cham, 2016. [Errata]
• Lake Michigan Workshop slides: "The edit distance on graphs": Part I, Part II, Part III
• Click here: Slides from the Pittsburgh+Pirate Minisymposium Schedule on Randomly Perturbed (Hyper)graphs.
• Current and former students.
• Discrete Math seminar page.