Back to Search
Start Over
Packing and covering tetrahedra.
- Source :
-
Discrete Applied Mathematics . Jun2013, Vol. 161 Issue 9, p1209-1215. 7p. - Publication Year :
- 2013
-
Abstract
- Abstract: Let be a -uniform hypergraph that has a geometric realization in . We show that there is a set of edges of that meets all copies of the complete subhypergraph in with , where denotes the maximum size of a set of pairwise edge-disjoint copies of in . This generalizes a result of Tuza on planar graphs. For we also prove two fractional weakenings of the same statement for arbitrary 3-uniform hypergraphs. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 161
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 89478280
- Full Text :
- https://doi.org/10.1016/j.dam.2010.05.027