Nathan Warnberg

activity

20142025

most citedRainbow arithmetic progressions

2 citations · 3 across the 11 of their papers we have counts for

collaborators

12 papers

math.CO2025

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 $G$ is the fewest number of colors needed to guarantee a rainbow $3$ -term arithmetic progression in $G$ , denoted $aw (G, 3)$ …

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…

math.CO2022

Anti-van der Waerden Numbers of Graph Products of Cycles

Joe Miller, Nathan Warnberg

A $k$ -term arithmetic progression ( $k$ -AP) in a graph $G$ is a list of vertices such that each consecutive pair of vertices is the same distance apart. If $c$ is a coloring functio…

math.CO2020

On leaky forcing and resilience

Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg +1

A leak is a vertex that is not allowed to perform a force during the zero forcing process. Leaky forcing was recently introduced as a new variation of zero forcing in order to anal…