Improved lower bounds for the Shannon capacity of odd cycles

Nathaniel Itty, Christopher D. Rosin, Chase Carstensen +1

The Shannon capacity $\hat{I}˜(G)$ of a graph $G$ quantifies the maximum rate at which information can be transmitted with zero error over a noisy channel. It is lower bounded by $α(G^d…