David E. Roberson

activity

20132020

most citedDeciding the existence of perfect entangled strategies for nonlocal games

7 citations · 8 across the 5 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

math.CO2018

Cores of Cubelike Graphs

Laura Mančinska, Irene Pivotto, David E. Roberson +1

A graph is $cubelike$ if it is a Cayley graph for some elementary abelian $2$ -group $Z_{2}^{n}$ . The core of a graph is its smallest subgraph to which it admits a hom…

math.CO2018

Vector Coloring the Categorical Product of Graphs

Chris Godsil, David E. Roberson, Brendan Rooney +2

A vector $t$ -coloring of a graph is an assignment of real vectors $p_{1}, \dots, p_{n}$ to its vertices such that $p_{i}^{T} p_{i} = t - 1$ for all $i = 1, \dots, n$ and $p_{i}^{T} p_{j} \leq - 1$ whene…