Pages that link to "Item:Q4187729"

The following pages link to On Some Problems of Lovász Concerning the Shannon Capacity of a Graph (Q4187729):

Displayed 19 items.

• On the independence numbers of the cubes of odd cycles (Q396806) ‎ (← links)
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (Q411372) ‎ (← links)
• Independent sets in graphs (Q501998) ‎ (← links)
• A new property of the Lovász number and duality relations between graph parameters (Q516767) ‎ (← links)
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle (Q686982) ‎ (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) ‎ (← links)
• Capacities: From information theory to extremal set theory (Q1337171) ‎ (← links)
• New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) ‎ (← links)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) ‎ (← links)
• A combinatorial approach to nonlocality and contextuality (Q2258010) ‎ (← links)
• Applications of Ramsey theory (Q2266026) ‎ (← links)
• New lower bounds for the Shannon capacity of odd cycles (Q2364621) ‎ (← links)
• Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) ‎ (← links)
• A limit theorem for the Shannon capacities of odd cycles I (Q4417260) ‎ (← links)
• A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958) ‎ (← links)
• Graph Information Ratio (Q4599114) ‎ (← links)
• On the Normalized Shannon Capacity of a Union (Q5366919) ‎ (← links)
• Linear Index Coding via Semidefinite Programming (Q5410256) ‎ (← links)
• (Q5743408) ‎ (← links)