Publications

Published

1. Novi H. Bong, Joshua Carlson, Bryan Curtis, Ruth Haas, Leslie Hogben. Isomorphisms and properties of TAR reconfiguration graphs for zero forcing and other X-set parameters (2022) to appear in Graphs and Combinatorics preprint  combuter code

2. Caroline Bang, Matias von Bell, Eric Culver, Jessica Dickson, Stoyan Dimitrov, Rachel Perrier, Sheila Sundaram. On sums, derivatives and flips of Riordan arrays. J. Integer Seq. (2022), accepted. preprint

3. József Balogh, Sean English, Emily Heath and  Robert A Krueger. Lower bounds on the Erdős-Gyárfás problem via color energy graphs, J. Graph Theory (2023), to appear. preprint DOI

4. Christopher Cox, Ryan R. Martin. The maximum number of 10- and 12-cycles in a planar graph. Discrete Mathematics 346:2  (2023) 113245 preprint DOI

5. Rachel Kirsch, Bernard Lidický, Clare Sibley, Elizabeth Sprangel. Shortened universal cycles for permutations Discrete Applied Mathematics, 324:15.  (2023) 219-228. preprint DOI

6. Christopher Cox,  Daniel McGinnis, Ryan R. Martin.  Accumulation points of the edit distance function. Discrete Mathematics 345:7 (2022) 112857 preprint DOI

7. Jane Breen, Steve Butler, Melissa Fuentes, Bernard Lidický, Michael Phillips, Alexander W. N. Riasanovksy, Sung-Yell Song, Ralihe R. Villagrán, Cedar Wiseman, Xiaohong Zhang. Hadamard diagonalizable graphs of order at most 36. Electronic J. of Combinatroics 29:2 (2022) P2.16 preprint DOI

8. Jane  Breen,  Alex W.N Riasaovsky, Michael Tait, and John Urschel, Maximum spread of graphs and bipartite graphs Comm. Amer. Math. Soc. 2 (2022), 417-480 preprint DOI

9. Christopher Cox, Ryan R. Martin. Counting paths, cycles and blow-ups in planar graphs Combinatorics, Probability and Computing, (31) 2022 345-367.  preprint DOI

10. Camacho Camacho, Silvia Fernández-Merchant, Jelić Milutinović, Rachel Kirsch, Linda Kleist, Elizabeth Matson, and Jennifer White. Bounding the tripartite-circle crossing number of complete tripartite graphs. Journal of Graph Theory, (2022) DOI

11. Daniel McGinnis. A family of convex sets in the plane satisfying the (4,3)-property can be pierced by nine points Discreter & Computational Geometry 68 (2022) 860-880 preprint DOI

12. Daniel McGinnis  and Shira Zerbib. Line Transversals in Families of Connected Sets in the Plane SIAM J. Discrete Math. 36:4 (2022) preprint DOI

13. Abdul Basit, Daniel McGinnis, Henry Simmons, Matt Sinnwell, and Shira Zerbib. Improved bounds on a generalization of Tuza's conjecture Electronic J. Combinatorics 29:4 (2022) P4.14 preprint DOI

14. Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg, Michael Young. On leaky forcing and resilience  Discrete Applied Mathematics 306:1 (2022). preprint DOI

15. Ryan R. Martin and Alexander Riasanovsky, On the edit distance function of the random graph, Combinatorics, Probability and Computing (2022), 31, pp. 345–367 preprint DOI 

16. G. Araujo-Pardo, Z. Berikkyzy, J. Faudree, K. Hogenson, R. Kirsch, L. Lesniak, and J. McDonald. "Finding long cycles in balanced tripartite graphs: a first step." In D. Ferrero et al. (eds), Research Trends in Graph Theory and Applications, Association for Women in Mathematics Series (Volume 25), 2021. DOI

17. Joshua Carlson, Robin Eagleton, Jesse Geneson, John Petrucci, Carolyn Reinhart, Preetul Sen. The damage throttling number of a graph, Australasian J. Comb. 80 (2021) 361-385 preprint link

18. Joshua Carlson, Juergen Kritschgau. Various Characterizations of Throttling Numbers, Discrete Applied Mathematics 294 (2021) 85097 preprint DOI

19. Rachel Kirsch, A. J. Radcliffe. Many cliques with few edges. Electronic Journal of Combinatorics 28 (2021) P1.26 DOI 

20. Jürgen Kritschgau. Rainbow matchings of size m in graphs with total color degree at least 2mn. Electronic Journal of Combinatorics 27 (2020) P3.18 DOI 

21. Minerva Catral, Lorenzo Ciardo, Leslie Hogben, Carolyn Reinhart. Spectral theory of products of digraphs Elect. Journal of Linear Alg. 36 (2020)(2020) preprint  

Preprints

1. Enrique Gomez-Leos, Emily Heath, Alex Parker, Coy Schwieder, Shira Zerbib, New bounds on f(n,5,8) (2023) preprint

2. Antwan Clark, Bryan A. Curtis, Edinah K. Gnang, Leslie Hogben. Apportionable matrices and gracefully labelled graphs (2023) preprint

3. Patrick Bennett, Emily Heath, Shira Zerbib. Edge-coloring a graph G so that every copy of a graph H has an odd color class (2023) preprint

4. Emily Heath, Ryan R. Martin, Chris Wells. The maximum number of odd cycles in a planar graph (2023) preprint

5. Daniel McGinnis: A necessary and sufficient condition for (2d−2)-transversals in ℝ2d (2023) preprint

6. Caroline Bang, Zdeněk Dvořák, Emily Heath, Bernard Lidický: Embedded graph 3-coloring and flow (2023) preprint

7. Daniel McGinnis: A combinatorial formula for the Ehrhart coefficients of a certain class of weighted multi-hypersimplices (2023) preprint

8. Zachary Brennan, Chris Cox, Bryan A. Curtis, Enrique Gomez-Leos, Kimberly P.  Hadaway, Leslie Hogben, Conor Thompson (2022) Orthogonal realizations of random sign patterns and other applications of the SIPP. preprint

9. Felix C. Clemen, Emily Heath, Mikhail Lavrov:  Online Ramsey numbers of ordered paths and cycles. (2022) preprint

10. Bryan Curtis, Luyining Gan, Jamie Haddock, Rachel Lawrence, Sam Spiro. Zero forcing with random sets.  (2022) preprint

11. Derek Hanely, Jeremy L. Martin, Daniel McGinnis, Dane Miyata, George D. Nasr, Andrés R. Vindas-Meléndez, Mei Yin Ehrhart Theory of Paving and Panhandle Matroids (2022). preprint

12. Zhanar Berikkyzy, Jürgen Kritschgau. Rainbow Solutions to the Sidon Equation in Cyclic Groups (2020) preprint

13. Joseph S. Alameda, Juergen Kritschgau, Michael Young. Generalizations of Leaky Forcing (2020) preprint 

14. Christopher Cox, Emily J. King, Dustin G. Mixon, Hans Parshall.  Uniquely optimal codes of low complexity are symmetric (2020)  preprint