KöMaL 2021 A807

Let $n \ge 2$ be a given integer. Let $G$ be a finite simple graph with the property that each of its edges is contained in at most $n$ cycles. Prove that the chromatic number of the graph is at most $n+1$.