On a Problem of C. E. Shannon in Graph Theory
From MaRDI portal
Publication:5525913
DOI10.2307/2035288zbMath0147.42801OpenAlexW4238651374MaRDI QIDQ5525913
No author found.
Publication date: 1967
Full work available at URL: https://doi.org/10.2307/2035288
Related Items
The \(k\)-fractal of a simplicial complex ⋮ On the ultimate independence ratio of a graph ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ An Analogue of the Shannon Capacity of a Graph ⋮ The independence number of the strong product of cycles ⋮ A Bound on the Shannon Capacity via a Linear Programming Variation ⋮ On the independence numbers of the cubes of odd cycles ⋮ Graphs with a Large Capacity ⋮ On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions ⋮ A new property of the Lovász number and duality relations between graph parameters ⋮ Independence numbers of product graphs ⋮ Applications of Ramsey theory ⋮ On the ratio of optimal integral and fractional covers ⋮ A limit theorem for the Shannon capacities of odd cycles I ⋮ Modified linear dependence and the capacity of a cyclic graph ⋮ Graph theory ⋮ Strong products of \(\chi\)-critical graphs ⋮ Matchings and covers in hypergraphs ⋮ Numerical invariants and the strong product of graphs ⋮ On zero-error codes produced by greedy algorithms ⋮ On the Shannon capacity of a directed graph
Cites Work
