Pages that link to "Item:Q4187729"
From MaRDI portal
The following pages link to On Some Problems of Lovász Concerning the Shannon Capacity of a Graph (Q4187729):
Displayed 36 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)
- The hat guessing number of graphs (Q777481) (← 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 unified construction of semiring-homomorphic graph invariants (Q2052822) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- On the Shannon capacity of sums and products of graphs (Q2111251) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- Faithful orthogonal representations of graphs from partition logics (Q2156425) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior (Q2314153) (← 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)
- Shannon capacity and the categorical product (Q2656906) (← 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)
- The minrank of random graphs (Q5002652) (← links)
- (Q5009505) (← links)
- (Q5009538) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- On the Normalized Shannon Capacity of a Union (Q5366919) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- The zero-error capacity of binary channels with 2-memories (Q6089460) (← links)
- Approximation of the Shannon capacity via matrix cone programming (Q6151010) (← links)
- Improved incidence bounds over arbitrary finite fields via the VC-dimension theory (Q6201908) (← links)