Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Shannon Capacity of a union To the memory of Paul Erdos
 

Summary: The Shannon Capacity of a union
Noga Alon
To the memory of Paul Erdos
Abstract
For an undirected graph G = (V, E), let Gn
denote the graph whose vertex set is V n
in which
two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff for all i between 1 and
n either ui = vi or uivi E. The Shannon capacity c(G) of G is the limit limn((Gn
))1/n
,
where (Gn
) is the maximum size of an independent set of vertices in Gn
. We show that there
are graphs G and H such that the Shannon capacity of their disjoint union is (much) bigger than
the sum of their capacities. This disproves a conjecture of Shannon raised in 1956.
1 Introduction
For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two
distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff for all i between 1 and n either
ui = vi or uivi E. The Shannon capacity c(G) of G is the limit limn((Gn))1/n, where (Gn) is

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University
Gasarch, William Ian - Institute for Advanced Computer Studies & Department of Computer Science, University of Maryland at College Park

 

Collections: Computer Technologies and Information Sciences; Mathematics