Michael Young

collaborators

4 papers

math.CO2017★ 2 cited

The relationship between $k$ -forcing and $k$ -power domination

Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter +1

Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In b…

math.CO2016

Anti-van der Waerden numbers of 3-term arithmetic progressions

Zhanar Berikkyzy, Alex Schulte, Michael Young

The \emph{anti-van der Waerden number}, denoted by $a w ([n], k)$ , is the smallest $r$ such that every exact $r$ -coloring of $[n]$ contains a rainbow $k$ -term arithmetic progression.…

math.CO2016

Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number

Leslie Hogben, Jephian C. -H. Lin, Michael Young

A traditional Nordhaus-Gaddum problem for a graph parameter $β$ is to find a (tight) upper or lower bound on the sum or product of $β (G)$ and $β (G ˉ)$ (where $G ˉ$ denotes…

math.CO2016

Rainbow Arithmetic Progressions in Finite Abelian Groups

Michael Young

For positive integers $n$ and $k$ , the \emph{anti-van der Waerden number} of $Z_{n}$ , denoted by $a w (Z_{n}, k)$ , is the minimum number of colors needed to color the el…

The relationship between k-forcing and k-power domination

Anti-van der Waerden numbers of 3-term arithmetic progressions

Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number

Rainbow Arithmetic Progressions in Finite Abelian Groups

The relationship between $k$ -forcing and $k$ -power domination