Ryan R. 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) in 2020. I was a Fulbright US Scholar as part of the Budapest Semesters in Mathematics program at the Alfred Rényi Institute of Mathematics in 2019.
email address:   rymartin@iastate.edu website:   http://rymartin.name Phone#: 515-294-1282 DEPARTMENT OF MATHEMATICS 428 CARVER HALL 411 MORRILL ROAD AMES, IOWA 50011-2104 Current CV ISU Math Office#: 515-294-1752 Publications ISU Math Fax#: 515-294-5454 arXiv WebEx room: rymartin MathSciNet

Latest preprints: 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. Induced saturation of the poset 2C2, with N. Veldt, submitted. B-colorings of planar and outerplanar graphs, with M. Ruszinkó, and G.N. Sárközy, submitted. Saturation of k-chains in the Boolean lattice, with N. Veldt, submitted. On the rainbow planar Turán number of paths, with E. Gyõri, A. Paulos, C. Tompkins, and K. Varga, submitted.

The maximum number of odd cycles in a planar graph, with E. Heath and C. Wells, J. Graph Theory, to appear. A note on the Erdős matching conjecture, with B. Patkós, Studia Sci. Math. Hungar., to appear. 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 C4-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].

Teaching: Fall 2024: M5680: Enumerative Combinatorics and Ordered Sets Time/Room: MWF 9:55-10:45, Carver 0190 Textbook: Class notes Canvas:  https://canvas.iastate.edu

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.

Spring Semester 2025: T Jan 21 - F May 09 MWF M T W Θ F TΘ [8] 7:45-8:35           8:00-9:15 [9] 8:50-9:40           9:30-10:45 [10] 9:55-10:45 M5680: Enumerative Combinatorics and Ordered Sets Carver 0190   M5680: Enumerative Combinatorics and Ordered Sets Carver 0190   M5680: Enumerative Combinatorics and Ordered Sets Carver 0190 [11] 11:00-11:50 Office Hours Carver 428   Office Hours Carver 428   Office Hours Carver 428 11:00-12:15 [12] 12:05-12:55   Topological Combinatorics Seminar Carver 401 12:10-1:00       12:40-1:55 [1] 1:10-2:00 Research (EG-L) Carver 428 Colloquium Carver 001 1:10-1:55   Faculty Meeting Carver 268 1:10-2:00 Research (NV) Carver 428 1:10-2:30 [2] 2:15-3:05       Discrete Math Seminar Carver 401 2:10-3:00 2:10-3:25   [3] 3:20-4:10       Research (EG-L) Carver 428 3:20-4:10   3:40-4:55 LAS Rep. Assembly Catt 302 3:40-5:00 [4] 4:25-5:15

Jun 16-24, 2024 International Conference on Graph Theory and its Applications (ICGTA 24), Jun 20-22 Talk Title: "Counting cycles in planar graphs" Presidency University Bengaluru, India Jul 17-24, 2024 Ph.D. Defense: Christian Winter, Jul 18 Karlsruhe Institute of Technology Karlsruhe, Germany Jul 24-Aug 04, 2024 Focused workshop on "Generalized and Planar Turán Problems", Jul 29-Aug 02 Rényi Institute Budapest, Hungary Aug 14-18, 2024 Research Visit to Zhanar Berikkyzy Fairfield University Fairfield, CT Sep 13-15, 2024 AMS Fall Central Sectional Meeting #1198, Sep 14-15 SS15A AMS Special Session on Graph Theory Talk Title: "Counting cycles in planar graphs" University of Texas at San Antonio San Antonio, Texas Dec 10-12, 2024 MathConnect 2024 Talk title: "Counting cycles in planar graphs" Dhahran, Saudi Arabia Wed-Sat Jan 08-11 Joint Mathematics Meetings #1203, Jan 10 SS 28A AMS Special Session on Coloring Problems in Combinatorics Talk Title: "B-colorings of planar and outerplanar graphs" Seattle Convention Center and the Sheraton Grand Seattle Seattle, Washington Mon-Fri Mar 17-21 SPRING BREAK Ames, IA Wed May 14 7:30am-9:30am FINAL EXAM: M5680 Ames, IA Mon-Fri Jun 16-27 Graduate Research Workshop in Combinatorics (GRWC) University of Vermont Burlington, VT Mon-Fri Jun 30- Jul 11 Scheduled visit by Debmalya Bandyopathyay, University of Birmingham Iowa State University, Ames, IA Mon-Fri Aug 04-08 The 22nd International Conference on Random Structures and Algorithms Vienna, Austria Mon-Fri Aug 25-29 European Conference on Combinatorics, Graph Theory and Applications (Eurocomb '25) Budapest, Hungary

Legend: Classroom Meeting Office Occasional Event

---

Ryan Martin's Web Page / Revised 20 January 2025.