Craig Erickson

activity

20142022

most citedRainbow arithmetic progressions

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

A combinatorial bound on the number of distinct eigenvalues of a graph

Sarah Allred, Craig Erickson, Kevin Grace +2

The smallest possible number of distinct eigenvalues of a graph $G$ , denoted by $q (G)$ , has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…

math.CO2022

Complementary Vanishing Graphs

Craig Erickson, Luyining Gan, Jürgen Kritschgau +2

Given a graph $G$ with vertices ${v_{1}, \dots, v_{n}}$ , we define $S (G)$ to be the set of symmetric matrices $A = [a_{i, j}]$ such that for $i \neq = j$ we have $a_{i, j} \neq = 0$ if…