On a fractional version of Haemers' bound

02/01/2018
by   Boris Bukh, et al.
0

In this note, we present a fractional version of Haemers' bound on the Shannon capacity of a graph, which is originally due to Blasiak. This bound is a common strengthening of both Haemers' bound and the fractional chromatic number of a graph. We show that this fractional version outperforms any bound on the Shannon capacity that could be attained through Haemers' bound. We show also that this bound is multiplicative, unlike Haemers' bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2021

On a tracial version of Haemers bound

We extend upper bounds on the quantum independence number and the quantu...
research
07/12/2023

Relative Fractional Independence Number and Its Applications

We define the relative fractional independence number of two graphs, G a...
research
02/20/2023

Metrization of powers of the Jensen-Shannon divergence

Metrization of statistical divergences is useful in both theoretical and...
research
11/03/2019

Shannon capacity and the categorical product

Shannon OR-capacity C_ OR(G) of a graph G, that is the traditionally mor...
research
01/12/2023

Redundancy of Codes with Graph Constraints

In this paper, we study the redundancy of linear codes with graph constr...
research
07/21/2022

Noncommutative extensions of parameters in the asymptotic spectrum of graphs

The zero-error capacity of a classical channel is a parameter of its con...
research
10/18/2020

A Framework to Quantify Approximate Simulation on Graph Data

Simulation and its variants (e.g., bisimulation and degree-preserving si...

Please sign up or login with your details

Forgot password? Click here to reset