1 citations · 1 across the 6 of their papers we have counts for
6 papers
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 …
Bounds for Rainbow-uncommon Graphs
Blake Bates, Zhanar Berikkyzy, Nick Chiem +6
We say a graph is -rainbow-uncommon if the maximum number of rainbow copies of under an -coloring of is asymptotically (as ) greater than what…
Anti-van der Waerden Numbers of Graph Products with Trees
Zhanar Berikkyzy, Joe Miller, Elizabeth Sprangel +2
Given a graph , an exact -coloring of is a surjective function . An arithmetic progression in of length with common difference is a se…
Triangle-degree and triangle-distinct graphs
Zhanar Berikkyzy, Beth Bjorkman, Heather Smith Blake +5
Let be a simple graph and be a vertex of . The triangle-degree of in is the number of triangles that contain . While every graph has at least two vertices wit…
Combinatorial Identities for Vacillating Tableaux
Zhanar Berikkyzy, Pamela E. Harris, Anna Pun +2
Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition…
On the existence of -cages
Gabriela Araujo-Pardo, Zhanar Berikkyzy, Linda Lesniak
In this paper, we work with simple and finite graphs. We study a generalization of the \emph{Cage Problem}, which has been widely studied since cages were introduced by Tutte \cite…