Skip to Main content Skip to Navigation
Journal articles

On packing of two copies of a hypergraph

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990481
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:07 PM
Last modification on : Thursday, October 4, 2018 - 10:12:02 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:24:02 PM

File

1041-6669-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990481, version 1

Collections

Citation

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

Share

Metrics

Record views

94

Files downloads

781