7 citations · 13 across the 15 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
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…
math.CO2016★ 3 cited
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.…