Research Papers

This is the collection of papers whose genesis was at a GRWC workshop. If you know of a paper that should be added to the list, please send the details to Combinatorics.Workshop@gmail.com.

  • Sam Spiro, Subset Parking Functions, J. Integer Sequences 22 (2019), Article 19.7.3.
  • Donglei Yang, Joshua Carlson, Andrew Owens, K. E. Perry, Inne Singgih, Zi-Xia Song, Fangfang Zhang and Xiaohong Zhang, Antimagic orientations of graphs with large maximum degree, submitted. arXiv:1908.06072
  • Carrie Frizzell, Generalized Bijective Maps between G-Parking Functions, Spanning Trees, and the Tutte Polynomial, submitted. arXiv:2005.06456
  • Margaret Bayer, Bennet Goeckner, Su Ji Hong, Tyrrell McAllister, McCabe Olsen, Casey Pinckney, Julianne Vega, and Martha Yip, Lattice polytopes from Schur and symmetric Grothendieck polynomials, submitted. arXiv:2005.09628
  • Emma Colaric, Ryan DeMuse, Jeremy L. Martin and Mei Yin, Interval parking functions, submitted. arXiv:2006.09321
  • Jane Breen, Steve Butler, Melissa Fuentes, Bernard Lidický, Michael Phillips, Alexander W. N. Riasanovksy, Sung-Yell Song, Ralihe R. Villagrán, Cedar Wiseman and Xiaohong Zhang, Hadamard diagonalizable graphs of order at most 36, submitted. arXiv:2007.09235

  • Yibo Gao, On the Critical Ideals of Complete Multipartite Graphs, Elec. J. Linear Algebra 36 (2020), 94-105.
  • Ayomikun Adeniran, Steve Butler, Colin Defant, Yibo Gao, Pamela E. Harris, Cyrus Hettle, Qingzhong Liang, Hayan Nam and Adam Volk, On the Genus of a quotient of a numerical semigroup, Semigroup Forum 98 (2019), 690-700. arxiv:1809.09360
  • Ayomikun Adeniran, Steve Butler, Galen Dorpalen-Barry, Pamela E. Harris, Cyrus Hettle, Qingzhong Liang, Jeremy L. Martin, and Hayan Nam, Enumerating Parking Completions Using Join and Split, Electron. J. Combin. 27 (2020), no. 2, #P2.44; arXiv:1912.01688
  • Boris Brimkov, Ken Duna, Leslie Hogben, Kate Lorenzen, Carolyn Reinhart, Sung-Yell Song and Mark Yarrow, Graphs that are cospectral for the distance Laplacian, submitted. arxiv:1812.05734
  • Adam Blumenthal, Bernard Lidicky, Ryan R. Martin, Sergey Norin, Florian Pfender and Jan Volec, Counterexamples to a conjecture of Harris on Hall ratio, to appear in SIAM Journal on Discrete Mathematics. arxiv.org:1811.11116
  • Edinah K. Gnang and Isaac Wass, Growing Graceful Trees, submitted. arxiv:1808.05551
  • Boris Brimkov, Jesse Geneson, Alathea Jensen, Jordan Miller and Pouria Salehi Nowbandegani, Intersections, circuits, and colorability of line segments, submitted. arxiv:1808.07176
  • Jesse Geneson, Amber Holmes, Xujun Liu, Dana Neidinger, Yanitsa Pehova and Isaac Wass, Ramsey numbers of ordered graphs under graph operations, submitted. arxiv:1902.00259
  • Colin Defant, Michael Engen and Jordan A. Miller, Stack-Sorting, Set Partitions, and Lassalle's Sequence, J. Combin. Theory. Ser. A. 175 (2020), article 105275. arxiv:1809.01340
  • Margaret Bayer, Bennet Goeckner, and Marija Jelić Milutinović, Manifold matching complexes, submitted. arXiv:1906.03328
  • Marija Jelić Milutinović, Helen Jenne, Alex McDonough, and Julianne Vega, Matching complexes of trees and applications of the matching tree algorithm. arXiv:1905.10560
  • Galen Dorpalen-Barry, Cyrus Hettle, David C. Livingston, Jeremy L. Martin, George Nasr, Julianne Vega, and Hays Whitlatch, A positivity phenomenon in Elser's Gaussian-cluster percolation model, submitted. arXiv:1905.11330
  • Adam Blumenthal, Bernard Lidický, Oleg Pikhurko, Yanitsa Pehova, Florian Pfender, and Jan Volec, Sharp bounds for decomposing graphs into edges and triangles, Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 463–468. arXiv:1909.11371

  • Minki Kim, Bernard Lidický, Tomáš Masařík, Florian Pfender, Notes on complexity of packing coloring, Information Processing Letters 137 (2018), 6-10. arxiv:1712.08373
  • Jane Breen, Boris Brimkov, Joshua Carlson, Leslie Hogben, K.E. Perry and Carolyn Reinhart, Throttling for the game of Cops and Robbers on graphs, Discrete Math. 341 (2018), 2418-2430. arxiv:1712.07728
  • Michael Ferrara, Daniel Johnston, Sarah Loeb, Florian Pfender, Alex Schulte, Heather Smith, Eric Sullivan, Michael Tait and Casey Tompkins, On Edge-colored Saturation Problems, to appear in J. Combinatorics. arxiv:1712.00163
  • Jinha Kim, Ryan R. Martin, Tomáš Masařík, Warren Shull, Heather C. Smith, Andrew Uzzell, Zhiyu Wang, On difference graphs and the local dimension of posets, European J. Combin. 86 (2020), 103074, 13 pp. arxiv:1803.08641
  • Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips and Carolyn Reinhart, The zero forcing polynomial of a graph, Discrete Appl. Math. 258 (2019), 35–48. arxiv:1801.08910
  • Anthony Bonato, Jane Breen, Boris Brimkov, Joshua Carlson, Sean English, Jesse Geneson, Leslie Hogben, K.E. Perry and Carolyn Reinhart, Cop throttling number: Bounds, values, and variants, submitted. arxiv:1903.10087

  • Alex Cameron and Emily Heath, A (5,5)-coloring of K_n with few colors, Combin. Probab. Comput. 28 (2018), 892{912. arxiv:1702.06227
  • Bennet Goeckner, Corbin Groothuis, Cyrus Hettle, Brian Kell, Pamela Kirkpatrick, Rachel Kirsch and Ryan Solava, Universal Partial Words over Non-Binary Alphabets, Theoretical Computer Science 713 (2018), 55-65. arxiv:1611.03928
  • Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song and Jason Williford, On the Wiener index, distance cospectrality and transmission regular graphs, Discrete Applied Math 230 (2017), 1-10. arxiv:1609.06911
  • Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický, Kacy Messerschmidt and Shanise Walker, Injective choosability of subcubic planar graphs with girth 6, Discrete Math 340 (2017), 2538-2549. arxiv:1611.03454
  • Aida Abiad, Boris Brimkov, Xavier Martinez-Rivera, O Suil and Jingmei Zhang, Spectral Bounds for the Connectivity of Regular Graphs with Given Order, Elec. J. Linear Algebra. 34 (2018), 17pp. arxiv.org:1703.02748
  • Sean English, Nathan Graber, Pamela Kirkpatrick, Abhishek Methuku and Eric Sullivan, Saturation for Berge Hypergraphs, Discrete Math 342 (2019), 1738-1761. arXiv:1710.03735
  • Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender and Andrew J. Uzzel, Ore and Chvatal-type Degree Conditions for Bootstrap Percolation from Small Sets, to appear in J. Graph Theory. arxiv:1610.04499
  • Aysel Erey, Zachary Gershkoff, Amanda Lohss and Ranjan Rohatgi, Characterization and Enumeration of 3-regular Permutation Graphs, submitted. arxiv:1709.06979
  • Ryan R. Martin, Abhishek Methuku, Andrew Uzzell, Shanise Walker, A Simple Discharging Method for Forbidden Subposet Problems, submitted. arXiv:1710.05057
  • Kirk Boyer, Lauren M. Nelsen, Luke L. Nelsen, Florian Pfender, Elizabeth Reiland and Ryan Solava, Erdos-Szekeres On-Line, submitted. arXiv:1804.05952
  • Garner Cochran, Corbin Groothuis, Andrew Herring, Ranjan Rohatgi and Eric Stucky, A New [Combinatorial] Proof of the Communtativity of Matching Polynomials for Cycles, submitted. arxiv:1810.05889

  • Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee and Matthew Yancey, I,F-Partitions of sparse graphs, European J. Comb. 57 (2016), 1-12. arxiv:1510.03381
  • Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy, Jay Cummings, Jessica DeSilva, Wei Gao, Kristin Heysse, Leslie Hogben, Franklin Kenter, Jephian C.-H. Lin and Michael Tait, On the Distance Spectra of Graphs, Linear Algebra Appl. 497 (2016) 66-87. arxiv:1509.01196
  • Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy, Leslie Hogben, Franklin Kenter, Jephian C.-H. Lin and Michael Tait, Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree, Elec. J. Linear Algebra 34 (2018), 373-380. arxiv:1507.02341
  • Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo and Brent Moran, A forest building process on simple graphs, Discrete Math. 341 (2018), 497-507. arxiv:1608.00335
  • Jessalyn Bolkema and Corbin Groothuis, Hunting Rabbits on the Hypercube, Discrete Math. 342 (2019), 360-372. arxiv:1701.08726
  • Beth Bjorkman, Garner Cochran, Wei Gao, Lauren Keough, Rachel Kirsch, Mitch Phillipson, Danny Rorabaugh, Heather Smith and Jennifer Wise, k-Foldability of Words, Discrete Applied Math. 259 (2019), 19-30. arXiv:1710.10616
  • Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan and Andrew J. Uzzell, Regular colorings and factors of regular graphs, to appear in Discuss. Math. Graph Theory. arxiv:1603.09384
  • Axel Brandt, Michael Ferrara, Nathan Graber, Stephen Hartke and Sarah Loeb, Plane Graphs with Maximum Degree 7 and no Adjacent Triangles are Entirely 10-Colorable, submitted.