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 2018Show all

4 papers · 1 filter

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.OA2018

Perfect strategies for non-signalling games

M. Lupini, L. Mancinska, V. I. Paulsen +5

We unify and consolidate various results about non-signall-ing games, a subclass of non-local two-player one-round games, by introducing and studying several new families of games…

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…

quant-ph2018

Oddities of quantum colorings

Laura Mančinska, David E. Roberson

We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxati…