ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 27(1) (2007)
Faculty of Applied Mathematics
AGH University of Science and Technology
Mickiewicza 30, 30-059 Kraków, Poland
Institute of Mathematics
Polish Academy of Sciences
Św. Tomasza 30, Kraków, Poland
We prove that a hypergraph which does not contain neither empty edge
∅ nor complete edge V(H) and has at most [1/2]n
edges is 2-packable.
A 1-uniform hypergraph of order n with more than [1/2]n edges shows
that this result cannot be improved by increasing the size of H.
Keywords: packing, hypergraphs.
2000 Mathematics Subject Classification: 05C65, 05C70.
Received 5 September 2005
Revised 12 January 2007