New lower bound on the Shannon capacity of \(C_7\) from circular graphs

DOI10.1016/j.ipl.2018.11.006zbMath1481.05118arXiv1808.07438OpenAlexW2888692103WikidataQ128920753 ScholiaQ128920753MaRDI QIDQ1711423

Sven C. Polak

Publication date: 18 January 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.07438

zbMATH Keywords

combinatorial problemsindependent setShannon capacitycircular graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coding theorems (Shannon theory) (94A24)

Related Items (5)

The zero-error capacity of binary channels with 2-memories ⋮ Approximation of the Shannon capacity via matrix cone programming ⋮ Topological bounds on the dimension of orthogonal representations of graphs ⋮ On upper bounding Shannon capacity of graph through generalized conic programming ⋮ On zero-error codes produced by greedy algorithms

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• The Shannon capacity of a union
• Problems in algebraic combinatorics
• Improved lower bound on the Shannon capacity of \(C_7\)
• New lower bounds for the Shannon capacity of odd cycles
• On the theta number of powers of cycle graphs
• A note on the star chromatic number
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• A limit theorem for the Shannon capacities of odd cycles I

This page was built for publication: New lower bound on the Shannon capacity of \(C_7\) from circular graphs