On packing of two copies of a hypergraph

Monika Pilsniak (1) , Mariusz Woźniak (1)

1 AGH UST - AGH University of Science and Technology [Krakow, PL]

A 2-packing of a hypergraph H is a permutation sigma on V (H) such that if an edge e belongs to epsilon(H), then sigma(e) does not belong to epsilon(H). Let H be a hypergraph of order n which contains edges of cardinality at least 2 and at most n - 2. We prove that if H has at most n - 2 edges then it is 2-packable.

Domaines: Mathématique discrète [cs.DM]

Monika Pilsniak, Mariusz Woźniak. On packing of two copies of a hypergraph. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 3 (3), pp.67--74. ⟨10.46298/dmtcs.537⟩. ⟨hal-00990481⟩