On packing of two copies of a hypergraph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

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.
Fichier principal
Vignette du fichier
1041-6669-1-PB.pdf (236.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990481 , version 1 (13-05-2014)

Identifiers

Cite

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⟩

Collections

TDS-MACS
27 View
745 Download

Altmetric

Share

Gmail Facebook X LinkedIn More