Relative capacity and dimension of graphs Original Research Article

A slight modification of our old definition of relative Shannon capacity of a graph with respect to another one is shown to be relevant to the Nešetřil–Pultr dimension of graphs. We give an upper bound for relative capacity in terms of graph entropy.