Nathan Warnberg

collaborators

3 papers

math.CO2024

Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs

Houston Schuerger, Nathan Warnberg, Michael Young

Motivated by a conjecture from the automated conjecturing program TxGraffiti, in this paper the relationship between the zero forcing number, $Z (G)$ , and the vertex independence nu…

math.CO2023

Anti-van der Waerden Numbers of Graph Products with Trees

Zhanar Berikkyzy, Joe Miller, Elizabeth Sprangel +2

Given a graph $G$ , an exact $r$ -coloring of $G$ is a surjective function $c : V (G) \to [1, \dots, r]$ . An arithmetic progression in $G$ of length $j$ with common difference $d$ is a se…

math.CO2023

Rainbow numbers of $[m] \times [n]$ for $x_{1} + x_{2} = x_{3}$

Kean Fallon, Ethan Manhart, Joe Miller +3

Consider the set $[m] \times [n] = {(i, j) : 1 \leq i \leq m, 1 \leq j \leq n}$ and the equation $x_{1} + x_{2} = x_{3}$ , namely $e q$ . The \emph{rainbow number of $[m] \times [n]$ for $e q$ }, d…

Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs

Anti-van der Waerden Numbers of Graph Products with Trees

Rainbow numbers of [m]×[n] for x1​+x2​=x3​

Rainbow numbers of $[m] \times [n]$ for $x_{1} + x_{2} = x_{3}$