New lower bound on the Shannon capacity of C7 from circular graphs
Combinatorics
2019-06-12 v2 Information Theory
math.IT
Abstract
We give an independent set of size in the fifth strong product power of , where is the cycle on vertices. This leads to an improved lower bound on the Shannon capacity of : . The independent set is found by computer, using the fact that the set is independent in the fifth strong product power of the circular graph . Here the circular graph is the graph with vertex set , the cyclic group of order , in which two distinct vertices are adjacent if and only if their distance (mod ) is strictly less than .
Cite
@article{arxiv.1808.07438,
title = {New lower bound on the Shannon capacity of C7 from circular graphs},
author = {Sven Polak and Alexander Schrijver},
journal= {arXiv preprint arXiv:1808.07438},
year = {2019}
}
Comments
5 pages. Some changes have been made based on comments of the referees. Accepted for publication in Information Processing Letters