EN
A 2-packing of a hypergraph 𝓗 is a permutation σ on V(𝓗) such that if an edge e belongs to 𝓔(𝓗), then σ (e) does not belong to 𝓔(𝓗).
We prove that a hypergraph which does not contain neither empty edge ∅ nor complete edge V(𝓗) and has at most 1/2n edges is 2-packable.
A 1-uniform hypergraph of order n with more than 1/2n edges shows that this result cannot be improved by increasing the size of 𝓗.