Abstract

This talk will provide a gentle introduction to the Shannon Capacity of graphs, a fundamental concept at the intersection of information theory and graph theory. The Shannon Capacity, introduced by Claude Shannon in 1956, quantifies the maximum amount of information that can be transmitted without error through a noisy communication channel, which is modeled as a graph. Despite decades of mathematical research, including work by members of our department, many seemingly basic problems surrounding Shannon Capacity remain open. We will survey some of these open questions.