The asymptotic spectrum distance, graph limits, and the Shannon capacity (opens in new tab)

arXiv:2404.16763v2 Announce Type: replace-cross Abstract: Determining the Shannon capacity of graphs is a long-standing open problem in information theory, graph theory and combinatorial optimization. Over decades, a wide range of upper and lower bound methods have been developed to analyze this problem. However, despite tremendous effort, even small instances of the problem have remained open. In recent years, a new dual characterization of the Shannon capacity of graphs, asymptotic spectrum...