Independence Number and Shannon Capacity of Bipartite Graph

61 Views Asked by At

Let $\alpha(G)$ denote the independence number of $G$ and $S(G)$ the Shannon capacity. Show that for every bipartite graph $G$, $\alpha(G)=S(G)$.

This seems to be true, but I'm not sure how to proceed with a rigorous proof. Any help would be much appreciated!

Edit 1: Does the result follow from König's Theorem?