On the Shannon capacity of sums and products of graphs

From MaRDI portal
Publication:2111251




Abstract: Let Theta(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 Theta(GsqcupH)>Theta(G)+Theta(H) and . This was shown independently by Wigderson and Zuiddam [2022] using Kadison-Dubois duality and the Axiom of choice.









This page was built for publication: On the Shannon capacity of sums and products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111251)