On the edge-coloring property for Hanani triple systems Original Research Article

We prove that the closure of every Hanani triple system is a resolvable hypergraph, hence it satisfies the Bergeʹs conjecture on linear hypergraphs.