2000 character limit reached
A Bound on the Shannon Capacity via a Linear Programming Variation (1804.05529v1)
Published 16 Apr 2018 in cs.IT, math.CO, and math.IT
Abstract: We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We show that our bound can outperform both the Lov\'asz theta number and the Haemers minimum rank bound. As a by-product, we also obtain a new upper bound on the broadcast rate of Index Coding.