The connection between the chromatic numbers of a hypergraph and its $1$-intersection graph

Zoltán L. Blázsik, Nathan W. Lemons

A well known problem from an excellent book of Lovász states that any hypergraph with the property that no pair of hyperedges intersect in exactly one vertex can be properly 2-colo…