A nontrivial lower bound on the shannon capacities of the complements of odd cycles

DOI10.1109/TIT.2002.808128MaRDI QIDQ4679949zbMATH OpenFDO

Authors Tom Bohman, Ron Holzman

Publication date 31 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.808128

Mathematics Subject Classification ID

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

Recommendations

• A limit theorem for the Shannon capacities of odd cycles I
• Improved lower bound on the Shannon capacity of C₇
• New lower bounds for the Shannon capacity of odd cycles
• A limit theorem for the Shannon capacities of odd cycles. II
• scientific article; zbMATH DE number 2197920

Cited in

(13)

• New lower bound on the Shannon capacity of \(C_7\) from circular graphs
• Improved lower bound on the Shannon capacity of C₇
• New lower bounds for the Shannon capacity of odd cycles
• Local chromatic number and Sperner capacity
• Shannon capacity and the categorical product
• On colorful edge triples in edge-colored complete graphs
• On the independence numbers of the cubes of odd cycles
• A limit theorem for the Shannon capacities of odd cycles I
• A limit theorem for the Shannon capacities of odd cycles. II
• Independent sets in graphs
• The zero-error capacity of binary channels with 2-memories
• An improved lower bound on the Shannon capacities of complements of odd cycles
• A combinatorial lemma and Shannon's theorem for binary symmetric channels

This page was built for publication: A nontrivial lower bound on the shannon capacities of the complements of odd cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679949)