Paper Info
Title
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.
Year
Venue
Keywords
2011
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
packing,hypergraphs
Field
DocType
Volume
Discrete mathematics,Combinatorics,Hypergraph,Permutation,Cardinality,Mathematics
Journal
13.0
Issue
ISSN
Citations 
3.0
1462-7264
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Monika Pilsniak1295.42
Mariusz Wozniak211119.51