Chromatic Index of Hypergraphs and Shannon’s Theorem

A classical theorem of Claude Shannon states that for any multigraph G without loops,χ′(G) ≤ 32Δ(G). We suggest a generalization of Shannon’s theorem to hypergraphs and prove it in case of hypergraphs without repeated edges of size2 .