Pages that link to "Item:Q2364621"
From MaRDI portal
The following pages link to New lower bounds for the Shannon capacity of odd cycles (Q2364621):
Displaying 12 items.
- Independent sets in graphs (Q501998) (← links)
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) (← links)
- Improved lower bound on the Shannon capacity of \(C_7\) (Q1847390) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- A unified construction of semiring-homomorphic graph invariants (Q2052822) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- On upper bounding Shannon capacity of graph through generalized conic programming (Q2329653) (← links)
- A “simple” rectangular puzzle (Q3439613) (← links)
- New Lower Bounds for Binary Constant-Dimension Subspace Codes (Q4643732) (← links)
- A limit theorem for the Shannon capacities of odd cycles. II (Q4825646) (← links)
- Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions (Q6074962) (← links)
- The zero-error capacity of binary channels with 2-memories (Q6089460) (← links)