Analogues of the Shannon Capacity of a Graph

DOI10.1016/S0304-0208(08)73501-1zbMath0501.05035OpenAlexW753810742MaRDI QIDQ3966167

Fred S. Roberts, Pavol Hell

Publication date: 1982

Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73501-1

zbMATH Keywords

independence numberchromatic numberclique numberShannon capacitystrong productlexicographic productKneser conjecture

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (14)

Chromatic difference sequences and homomorphisms ⋮ On the chromatic number of the lexicographic product and the Cartesian sum of graphs ⋮ On the ultimate independence ratio of a graph ⋮ On the ultimate normalized chromatic difference sequence of a graph ⋮ An Analogue of the Shannon Capacity of a Graph ⋮ The independence number of the strong product of odd cycles ⋮ The independence number of the strong product of cycles ⋮ Coloring graph products---a survey ⋮ On the bounds for the ultimate independence ratio of a graph ⋮ Acyclic coloring of products of digraphs ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the fractional chromatic number and the lexicographic product of graphs

This page was built for publication: Analogues of the Shannon Capacity of a Graph