4 papers
Matrix Apportionment: General Cases and Apportionment Constants
Dustin R. Baker, Bryan A. Curtis, Joe Miller +1
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their o…
Full classification of anti-van der Waerden numbers of graph products of forests
Zhanar Berikkyzy, Joe Miller, Nathan Warnberg
The anti-van der Waerden number of a graph is the fewest number of colors needed to guarantee a rainbow -term arithmetic progression in , denoted …
On the proper rainbow saturation numbers of cliques, paths, and odd cycles
Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap +7
Given a graph , we say a graph is properly rainbow -saturated if there is a proper edge-coloring of which contains no rainbow copy of , but adding any edge to …
Anti-van der Waerden Numbers of Graph Products of Cycles
Joe Miller, Nathan Warnberg
A -term arithmetic progression (-AP) in a graph is a list of vertices such that each consecutive pair of vertices is the same distance apart. If is a coloring functio…