Ryan Martin's Students

• J. Breen, S. Butler, M. Fuentes, B. Lidický, M. Phillips, A.W.N. Riasanovsky, S.-Y. Song, R.R. Villagrán, C. Wiseman, and X. Zhang, Hadamard diagonalizable graphs of order at most 36, submitted.
• R.R. Martin and A.W.N. Riasanovsky, On the edit distance function of the random graph, submitted.
• S.N. Harding and A.W.N. Riasanovsky, Moments of the weighted Cantor measures, Demonstr. Math., 52(1) (2019), 256--273.
• A. Gyárfás, A.W.N. Riasanovsky, and M.U. Sherman-Bennet, Chromatic Ramsey numbers of acyclic hypergraphs, Discrete Math., 340(3) (2017), 373--378.
• A. Collins, A.W.N. Riasanovsky, J.C. Wallace, and S. Radziszowski, Zarankiewicz numbers and bipartite Ramsey numbers, Journal of Algorithms and Computation, 47(1) (2016), 63--78.
• J.N. Cooper and A.W.N. Riasanovsky, On the reciprocal of the binary generating function for the sum of divisors, J. Integer Seq., 16(1) (2013), Article 13.1.8, 13pp.

• S.E. Anderson, K.L. Collins, D. Ferrero, L. Hogben, C. Mayer, A.N. Trenk, and S. Walker, Product throttling, submitted.
• S.E. Anderson, K.L. Collins, D. Ferrero, L. Hogben, C. Mayer, A.N. Trenk, and S. Walker, Product throttling for power domination, submitted.
• R. Alvarado, M. Averett, B. Gaines, C. Jackson, M.L. Karker, M.A. Marciniak, F. Su, and S. Walker, The game of cycles, submitted.
• Zh. Berikkyzy, A. Schulte, E. Sprangel, S. Walker, N. Warnberg, M. Young, Anti-van der Waerden numbers on graphs, submitted.
• É. Czabarka, L.A. Szekely, Z. Toroczkai, and S. Walker, An algebraic Monte-Carlo algorithm for the Partition Adjacency Matrix reealization problem, submitted.
• R.R. Martin, H.C. Smith, and S. Walker, Improved bounds for induced poset saturation, Electron. J. Combin. 27(2) (2020), Paper No. 2.31, 9pp.
• R.R. Martin, A. Methuku, A. Uzzell, and S. Walker, A simple proof for a forbidden subposet problem, Electron. J. Combin. 27(1) (2020), Paper No. 1.31, 9pp.
• R.R. Martin and S. Walker, A note on the size of N-free families, Eur. J. Math. 3(2) (2017), 429--432.
• B. Brimkov, J. Edmond, R. Lazar, B. Lidický, K. Messerschmidt, and S. Walker, Injective choosability of subcubic planar graphs with girth 6, Discrete Math. 340 (2017), no. 10, 2538--2549.
• L. Hogben, M. Huynh, N. Kingsley, S. Meyer, S. Walker, M. Young, Propagation time for zero forcing on a graph, Discrete Appl. Math.160 (2012), no. 13-14, 1994-2005.

Dissertation: The edit distance function: Forbidding induced powers of cycles and other questions
Awards: Mathematics Department Research Award (2016), Alberta Wolfe Research Fellowship (2015), Graduate College Teaching Award (2014)

• Zh. Berikkyzy and J. Kritschgau, Rainbow solutions to the Sidon equation in cyclic groups, submitted.
• Zh. Berikkyzy, A. Brandt, S. Jahanbekam, V. Larsen, D. Rorabaugh, List-antimagic labelings of weighted and oriented graphs, submitted.
• Zh. Berikkyzy, R.R. Martin and C. Peck, On the edit distance of powers of cycles, Discrete Math. 342(10) (2019), 2804--2817.
• G. Aalipour, A. Abiad, Zh. Berikkyzy, L. Hogben, F.H.J. Kenter, J.C.-H. Lin, M. Tait, Proof of a conjecture of Graham and Lovász concerning the unimodality of coefficients of the distance characteristic polynomial of a tree, Electron. J. Linear Algebra 34 (2018), 373--380.
• Zh. Berikkyzy, S. Butler, J. Cummings, K. Heysse, P. Horn, R. Luo, B. Moran, A forest building process on simple graphs, Discrete Math. 341(2) (2018), 497--507.
• Zh. Berikkyzy, C. Cox, M. Dairyko, K. Hogenson, M. Kumbhat, B. Lidický, K. Messerschmidt, K. Moss, K. Nowak, K.F. Palmowski, D. Stolee, (4,2)-choosability of planar graphs with forbidden structures, Graphs Combin. 33(4) (2017), 751--787.
• Zh. Berikkyzy, A. Schulte, M. Young, Anti-van der Waerden numbers of 3-term arithmetic progressions, Electron. J. Combin. 24(2) (2017), Paper No. 2.39, 9pp.
• G. Aalipour, A. Abiad, Zh. Berikkyzy, J. Cummings, J. De Silva, W. Gao, K. Heysse, L. Hogben, F.H.J. Kenter, J.C.-H. Lin, M. Tait, On the distance spectra of graphs, Linear Algebra Appl. 497 (2016), 66--87.
• S.N. Kharin and Zh. Berikkyzy, A method for solving the inverse Verigin problem of oil-water contact under elastic conditions. (Russian) Math. Zh. 8 (2008), no.2(28), 38--43, 105.

• J. Fallon, K. Hogenson, L. Keough, M. Lomelí, M. Schaefer, and P. Soberón, A note on the maximum rectilinear crossing number of spiders, J. Combin. Math. Combin. Comput. 113 (2020), 127--139.
• K. Hogenson, R.R. Martin, and Y. Zhao, Tiling tripartite graphs with 3-colorable graphs: the extreme case, Graphs Combin. 34(5) (2018), 1049--1075.
• Zh. Berikkyzy, C. Cox, M. Dairyko, K. Hogenson, M. Kumbhat, B. Lidický, K. Messerschmidt, K. Moss, K. Nowak, K.F. Palmowski, and D. Stolee, (4,2)-choosability of planar graphs with forbidden structures, Graphs Combin. 33 (2017), no. 4, 751--787.
• S. Butler, C. Erickson, L. Hogben, K. Hogenson, L. Kramer, R.L. Kramer, J.C.-H. Lin, R.R. Martin, D. Stolee, N. Warnberg and M. Young, Rainbow arithmetic progressions,  J. Comb. 7 (2016), no. 4, 595–626.
• K. Hogenson, S. Negaard and R.J. Zerr, Matrix sequences associated with the Ducci map and the mediant construction of the rationals, Linear Algebra Appl. 437(1) (2012), 285--293.
• E. Almodovar, L. DeLoss, L. Hogben, K. Hogenson, K. Murphy, T. Peters, and C.A. Ramirez, Minimum rank, maximum nullity and zero forcing number for selected graph families, Involve 3(4) (2010), 371--392.

• S. Butler, C. Erickson, L. Hogben, K. Hogenson, L. Kramer, R.L. Kramer, J.C.-H. Lin, R.R. Martin, D. Stolee, N. Warnberg, and M. Young, Rainbow arithmetic progressions, J. Comb. 7 (2016), no. 4, 595–626.
• L. Kramer, R.R. Martin, and M. Young, On diamond-free subposets of the Boolean lattice, Journal of Combinatorial Theory, Series A 120(3) (2012), 545--560.

2021-present: Data Analyst at the Avera Hospital System, Sioux Falls, SD
2017-2021: Assistant Professor of Mathematics at Briar Cliff University, Sioux City, IA
2015-2017: Assistant Professor at Bethel College, North Newton, KS
2014-2015: Visiting Instructor at Carroll College, Helena, MT

• Z. Berikkyzy, R.R. Martin, and C. Peck, On the edit distance of powers of cycles, submitted.
• M. Axenovich and C. (Sackett) Peck, Avoiding rainbow induced subgraphs in edge-colorings, Australas. J. Combin. 44 (2009), 287--296.

• M. Axenovich, J. Choi, M. Lastrina, T. McKay, J. Smith, and B. Stanton, On the Chromatic number of subsets in the Euclidean plane, Graphs Combin. 30(1) (2014), 71--81.
• R.R. Martin and J.J. Smith, Induced saturation number, Discrete Mathematics, 312(21) (2012), pp. 3096--3106.
• L. DeLoss, J. Grout, L. Hogben, T. McKay, J.J. Smith, and G. Tims, Techniques for determining the minimum rank of a small graph, Linear Algebra Appl. 432(11) (2010), 2995--3001.

2017-present: Associate Professor of Mathematics at Graceland University
2012-2017: Assistant Professor of Mathematics at Graceland University, Lamoni, IA [Homepage]
Board member, Iowa MAA, 2015-2017

• R.R. Martin and T. McKay, On the edit distance from K_2,t-free graphs, J.Graph Theory, 77(2) (2014), 117--143.
• M. Axenovich, J. Choi, M. Lastrina, T. McKay, J. Smith, and B. Stanton, On the Chromatic number of subsets in the Euclidean plane, Graphs Combin. 30(1) (2014), 71--81.
• L. DeLoss, J. Grout, L. Hogben, T. McKay, J.J. Smith, and G. Tims, Techniques for determining the minimum rank of a small graph, Linear Algebra Appl. 432(11) (2010), 2995--3001.

• L. Özkahya and B. Stanton, On a covering problem in the hypercube, Graphs Combin., 31(1) (2015), 235--242.
• M. Axenovich, J. Choi, M. Lastrina, T. McKay, J. Smith, and B. Stanton, On the Chromatic number of subsets in the Euclidean plane, Graphs Combin. 30(1) (2014), 71--81.
• B. Stanton, Vertex identifying codes for the n-dimensional lattice, Australas. J. Combin. 53 (2012), 299--307.
• B. Stanton, Improved bounds for r-identifying codes of the hex grid, SIAM J. Discrete Math. 25(1) (2011), 159--169.
• R.R. Martin and B. Stanton, Lower bounds for identifying codes in some infinite grids, Electron. J. Combin. 17(1) (2010) Research Paper 119, 16pp.