Chromatic index of hypergraphs and Shannon's theorem

Abstrakt

A classical theorem of Claude Shannon says that for any multigraph G without loops, $\chi'(G)\le\lfloor\frac{3}{2}\Delta(G)\rfloor$. We suggest a generalization to hypergraphs and prove it in case of hypergraphs without repeated edges of size 2.