Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

In 1977, Erdős asked the following question: for any integers $t,n\in \mathbb{N}$, if $G_1,\dots ,G_n$ are complete graphs such that each $G_i$ has at most $n$ vertices and ev…