The Lov'asz number is not alone: a continuum of R'enyi points in the entanglement-assisted spectrum of graphs

Li and Zuiddam's entanglement-assisted asymptotic spectrum of graphs consists of the normalized graph parameters that are additive under disjoint unions, multiplicative under strong products and monotone under entanglement-assisted cohomomorphisms; the entanglement-assisted Shannon capacity is their pointwise minimum. To our knowledge, the Lovász number was its only known element. We find a continuum of others. Three quantities of Duan and Winter, 2, the minimal Holevo capacity C and the logarithm of the no-signalling simulation cost Σ, are the smallest information radii of classical-quantum channels compatible with a graph, measured with Petz-Rényi divergences of orders 0, 1 and 2. At order zero this is due to Schrijver (as credited by Dalai) and to Duan and Winter; at order one it is the min-max formula for the Holevo capacity. Interpolating in the order gives a family α, 0 α 2, and we prove that every member lies in the spectrum. The main step, multiplicativity under strong products for channels that need not factor, follows from an exact nesting identity for compressions. Sandwiched Rényi radii of order β in[1/2, infinity] give the same family, at α=2-1/β. On the five-cycle the family takes every value in [sqrt5,5/2]. A Hilbert-Schmidt inequality for the pentagon gives C(C 5)= 2(5/2), proving a conjecture of Duan and Winter. We also settle the two open links of their inequality chain: the graph-level no-signalling simulation rate always equals its single-letter value 2Σ(G), and a 32-vertex graph from the Mermin-Peres magic square has C< 2Σ, certified in exact rational arithmetic. Finally, Σ never exceeds the projective rank of the complement; a rank inequality for the same square makes this strict on a 1440-vertex graph.