7 citations · 13 across the 15 of their papers we have counts for
18 papers
Maximizing the number of stars in graphs with forbidden properties
Zhanar Berikkyzy, Kirsten Hogenson, Rachel Kirsch +1
Erdős proved an upper bound on the number of edges in an -vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph famil…
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 Correspondence Between Integer Sequences and Vacillating Tableaux
Zhanar Berikkyzy, Pamela E. Harris, Anna Pun +2
A fundamental identity in the representation theory of the partition algebra is for , where ranges over integer partitions of , is t…
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…
On the Limiting Vacillating Tableaux for Integer Sequences
Zhanar Berikkyzy, Pamela E. Harris, Anna Pun +2
A fundamental identity in the representation theory of the partition algeba is for , where ranges over integer partitions of , is th…
Rainbow Solutions to the Sidon Equation in Cyclic Groups
Zhanar Berikkyzy, Jürgen Kritschgau
Given a coloring of group elements, a rainbow solution to an equation is a solution whose every element is assigned a different color. The rainbow number of for an e…
Anti-van der Waerden numbers on Graphs
Zhanar Berikkyzy, Alex Schulte, Elizabeth Sprangel +3
In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph…
A forest building process on simple graphs
Zhanar Berikkyzy, Steve Butler, Jay Cummings +4
Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in…
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 , is the smallest such that every exact -coloring of contains a rainbow -term arithmetic progression.…
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
List-antimagic labeling of vertex-weighted graphs
Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam +2
A graph is - if for any vertex weighting and any list assignment with $|L(e)|\geq |E(G)|…
On the distance spectra of graphs
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8
The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…
On the Edit Distance of Powers of Cycles
Zhanar Berikkyzy, Ryan R. Martin, Chelsea Peck
The edit distance between two graphs on the same labeled vertex set is defined to be the size of the symmetric difference of the edge sets. The edit distance function of a heredita…
Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +4
We establish a conjecture of Graham and Lovász that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-conca…