KöMaL problem A, 2021

Combinatorics Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

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$ .

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.