98 citations · 348 across the 30 of their papers we have counts for
5 papers · 1 filter
Rainbow numbers for in
Erin Bevilacqua, Samuel King, Jürgen Kritschgau +3
In this work, we investigate the fewest number of colors needed to guarantee a rainbow solution to the equation in . This value is called the Rain…
Lower Bounds for the Exponential Domination Number of
Chassidy Bozeman, Joshua Carlson, Michael Dairyko +2
A vertex in a porous exponential dominating set assigns weight to vertex . A porous exponential dominating set of a graph is a su…
A linear programming method for exponential domination
Michael Dairyko, Michael Young
For a graph the set is a porous exponential dominating set if for every where $dist(d,v)…
Anti-van der Waerden numbers on Graphs
Zhanar Berikkyzy, Alex Schulte, Elizabeth Sprangel +3
In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph…
Anti-Ramsey Multiplicities
Jessica De Silva, Xiang Si, Michael Tait +3
The Ramsey multiplicity constant of a graph is the minimum proportion of copies of in the complete graph which are monochromatic under an edge-coloring of as goes…