New lower bound on the Shannon capacity of C7 from circular graphs.

Sven C. Polak, Alexander Schrijver

Research output: Contribution to journalArticleScientificpeer-review

42 Downloads (Pure)

Abstract

We give an independent set of size 367 in the fifth strong product power of C7, where C7 is the cycle on 7 vertices. This leads to an improved lower bound on the Shannon capacity of C7: (C7) ≥ 3671/5 > 3.2578. The independent set is found by computer, using the fact that the set {t ·(1, 7, 72, 73, 74) | t ∈ Z382} ⊆ Z5 382 is independent in the fifth strong product power of the circular graph C108,382. Here the circular graph Ck,n is the graph with vertex set Zn, the cyclic group of order n, in which two distinct vertices are adjacent if and only if their distance (mod n) is strictly less than k.
Original languageEnglish
JournalInformation Processing Letters
Volumeabs/1808.07438
DOIs
Publication statusPublished - 2018
Externally publishedYes

Keywords

  • shannon capacity
  • independent set
  • circular graph
  • combinatorial problems

Fingerprint

Dive into the research topics of 'New lower bound on the Shannon capacity of C7 from circular graphs.'. Together they form a unique fingerprint.

Cite this