24 citations · 78 across the 21 of their papers we have counts for
5 papers · 1 filter
Pairing strategies for the Maker-Breaker game on the hypercube with subcubes as winning sets
Ramin Naimi, Eric Sundberg
We consider the Maker-Breaker positional game on the vertices of the -dimensional hypercube with -dimensional subcubes as winning sets. We describe a pairing stra…
A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation
Ramin Naimi, Eric Sundberg
We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation , where is prime. This comb…
Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
Ramin Naimi, Elena Pavelescu, Hannah Schwartz
We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.
Induced Subgraphs of Johnson Graphs
Ramin Naimi, Jeffrey Shaw
The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements. Unli…
List Coloring and -monophilic graphs
Radoslav Kirov, Ramin Naimi
In 1990, Kostochka and Sidorenko proposed studying the smallest number of list-colorings of a graph among all assignments of lists of a given size to its vertices. We say a…