3 problems

Odd Alternating Cycle Conjecture. For every field $\mathbb{F}$ there exist $\varepsilon>0$ and an odd integer $\ell$ such that every $n$-vertex directed graph $G$ with

Let SUICP(SNC) denote the single-unicast index-coding problem with symmetric neighboring side information, with $K$ receivers and messages, interference parameter $D$, and side-inf…

Let $\mathbb{F}$ be a field. A digraph is an alternating odd cycle if its underlying undirected graph is a cycle and the orientations of its edges alternate with one exception. For…