Publication date
January 1979
DOIAbstract
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be negative
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be negative
AbstractLet G = (V, E) be a graph with vertex set V and edge set E, and let P be a probability distr...
AbstractUsing an inclusion-exclusion formula for the symmetric difference and its associated Bonferr...
A mapping x:V→{-1,1} is called negative if ∑u∈N[v]x(u)≤1 for every v∈V. The maximum of the values of...
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
The Shannon capacity problem in undirected graphs is well known [7]. This problem can be naturally g...
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 ...
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) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, f...
This thesis focuses on a problem formulated by Claude Shannon named the Shannon capacity. This probl...
The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with ...
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)...
AbstractIn this paper the problem of characterizing extremal graphsKnrelatively to the number of neg...
This paper provides new observations on the Lovász θ-function of graphs. These include a simple clos...
AbstractLet G = (V, E) be a graph with vertex set V and edge set E, and let P be a probability distr...
AbstractUsing an inclusion-exclusion formula for the symmetric difference and its associated Bonferr...
A mapping x:V→{-1,1} is called negative if ∑u∈N[v]x(u)≤1 for every v∈V. The maximum of the values of...
The answers to several problems of Lovász concerning the Shannon capacity of a graph are shown to be...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
The Shannon capacity problem in undirected graphs is well known [7]. This problem can be naturally g...
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 ...
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) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, f...
This thesis focuses on a problem formulated by Claude Shannon named the Shannon capacity. This probl...
The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with ...
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)...
AbstractIn this paper the problem of characterizing extremal graphsKnrelatively to the number of neg...
This paper provides new observations on the Lovász θ-function of graphs. These include a simple clos...
AbstractLet G = (V, E) be a graph with vertex set V and edge set E, and let P be a probability distr...
AbstractUsing an inclusion-exclusion formula for the symmetric difference and its associated Bonferr...
A mapping x:V→{-1,1} is called negative if ∑u∈N[v]x(u)≤1 for every v∈V. The maximum of the values of...
Add to ORKG