Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs

Details Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs

2011-12-31

arxiv.org/abs/1201.0304v1

Mathematics

Combinatorics

9 pages

Scientific paper

In this note we study Shannon capacity of channels in the context of classical Ramsey numbers. We overview some of the results on capacity of noisy channels modelled by graphs, and how some constructions may contribute to our knowledge of this capacity. We present an improvement to the constructions by Abbott and Song and thus establish new lower bounds for a special type of multicolor Ramsey numbers. We prove that our construction implies that the supremum of the Shannon capacity over all graphs with independence number 2 cannot be achieved by any finite graph power. This can be generalized to graphs with any bounded independence number.

Affiliated with

Also associated with

No associations

Rating

Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-673756