A conjecture of Berge about linear hypergraphs and Steiner systems S(2,4,v) Original Research Article

A famous conjecture of Berge about linear hypergraphs is studied. It is proved that all nearly resolvable Steiner systems S(2,4,v) and all almost nearly resolvable S(2,4,v) verify this conjecture.