The Shannon Capacity of a Union
β Scribed by Noga Alon
- Publisher
- Springer-Verlag
- Year
- 1998
- Tongue
- English
- Weight
- 191 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we will define the product of two association schemes and using the fact that the strong product of two graphs from two (possibly different) association schemes is in the product of the association schemes, we give a new proof of Schrijver's result on the Shannon capacity of graphs in
An independent set with 108 vertices in the strong product of four 7-cycles (C 7 C 7 C 7 C 7 ) is given. This improves the best known lower bound for the Shannon capacity of the graph C 7 which is the zero-error capacity of the corresponding noisy channel. The search was done by a computer program u
We prove that the edges of a self-complementary graph and its complement can be oriented in such a way that they remain isomorphic as digraphs and their union is a transitive tournament. This result is used to explore the relation between the Shannon and Sperner capacity of certain graphs. In partic