Pages that link to "Item:Q3546492"
From MaRDI portal
The following pages link to The Shannon capacity of a graph and the independence numbers of its powers (Q3546492):
Displaying 13 items.
- Independent sets in graphs (Q501998) (← links)
- On cover-structure graphs (Q967385) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- On a diagonal conjecture for classical Ramsey numbers (Q2322886) (← links)
- Symmetric Shannon capacity is the independence number minus 1 (Q2678437) (← links)
- Graph Information Ratio (Q4599114) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- On the Normalized Shannon Capacity of a Union (Q5366919) (← links)
- The zero-error capacity of binary channels with 2-memories (Q6089460) (← links)
- Approximation of the Shannon capacity via matrix cone programming (Q6151010) (← links)
- Colouring strong products (Q6612523) (← links)
- Redundancy of codes with graph constraints (Q6629091) (← links)
