A new property of the Lovász number and duality relations between graph parameters
arXiv:1505.01265 · doi:10.1016/j.dam.2016.04.028
Abstract
We show that for any graph , by considering "activation" through the strong product with another graph , the relation between the independence number and the Lovász number of can be made arbitrarily tight: Precisely, the inequality \[ α(G \times H) \leq \vartheta(G \times H) = \vartheta(G)\,\vartheta(H) \] becomes asymptotically an equality for a suitable sequence of ancillary graphs . This motivates us to look for other products of graph parameters of and on the right hand side of the above relation. For instance, a result of Rosenfeld and Hales states that \[ α(G \times H) \leq α^*(G)\,α(H), \] with the fractional packing number , and for every there exists that makes the above an equality; conversely, for every graph there is a that attains equality. These findings constitute some sort of duality of graph parameters, mediated through the independence number, under which and are dual to each other, and the Lovász number is self-dual. We also show duality of Schrijver's and Szegedy's variants and of the Lovász number, and explore analogous notions for the chromatic number under strong and disjunctive graph products.
16 pages, submitted to Discrete Applied Mathematics for a special issue in memory of Levon Khachatrian; v2 has a full proof of the duality between theta+ and theta- and a new author, some new references, and we corrected several small errors and typos
References in corpus (2)
Cited by in corpus (6)
- On converse bounds for classical communication over quantum channels
- Observations on the Lovász -Function, Graph Capacity, Eigenvalues, and Strong Products
- Observations on Graph Invariants with the Lovász -Function
- Uncertainty relations from state polynomial optimization
- Exploring the boundary of quantum correlations with a time-domain optical processor
- Duality of Graph Invariants