Let Θ(G) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, for any graphs G and H, of the inequalities Θ(G⊔H)>Θ(G)+Θ(H) and Θ(G⊠H)>Θ(G)Θ(H). This was shown independently by Wigderson and Zuiddam (2022) using Kadison–Dubois duality and the Axiom of choice
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
A symmetric variant of Shannon capacity is defined and computed.Comment: 4 pages, submitted to Elect...
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be...
For an undirected graph G = (V, E), let G n denote the graph whose vertex set is V n in which two di...
Let G 1 × G 2 denote the strong product of graphs G 1 and G 2, that is, the graph on V(G 1) × V(G 2)...
The Shannon capacity problem in undirected graphs is well known [7]. This problem can be naturally g...
Let Θ(G) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, f...
Given two graphs G = (V(G), QG)) and H = (V(H), €(H)), the sum of G and H, G + H, is the disjoint un...
AbstractIn this paper we will define the product of two association schemes and using the fact that ...
AbstractA slight modification of our old definition of relative Shannon capacity of a graph with res...
A slight modification of our old definition of relative Shannon capacity of a graph with respect to ...
AbstractLet G = (V, E) be a graph with vertex set V and edge set E, and let P be a probability distr...
The Shannon capacity of every induced subgraph of a perfect graph equals its clique number. However,...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
A symmetric variant of Shannon capacity is defined and computed.Comment: 4 pages, submitted to Elect...
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be...
For an undirected graph G = (V, E), let G n denote the graph whose vertex set is V n in which two di...
Let G 1 × G 2 denote the strong product of graphs G 1 and G 2, that is, the graph on V(G 1) × V(G 2)...
The Shannon capacity problem in undirected graphs is well known [7]. This problem can be naturally g...
Let Θ(G) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, f...
Given two graphs G = (V(G), QG)) and H = (V(H), €(H)), the sum of G and H, G + H, is the disjoint un...
AbstractIn this paper we will define the product of two association schemes and using the fact that ...
AbstractA slight modification of our old definition of relative Shannon capacity of a graph with res...
A slight modification of our old definition of relative Shannon capacity of a graph with respect to ...
AbstractLet G = (V, E) be a graph with vertex set V and edge set E, and let P be a probability distr...
The Shannon capacity of every induced subgraph of a perfect graph equals its clique number. However,...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
A symmetric variant of Shannon capacity is defined and computed.Comment: 4 pages, submitted to Elect...
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be...
DOI
Add to ORKG