Name
Abstract | ||
|---|---|---|
Let H be a d-uniform hypergraph that has a geometric realization in R^d. We show that there is a set C of edges of H that meets all copies of the complete subhypergraph K"d"+"1^d in H with |C|@?(@?d2@?+1)@n(H), where @n(H) denotes the maximum size of a set of pairwise edge-disjoint copies of K"d"+"1^d in H. This generalizes a result of Tuza on planar graphs. For d=3 we also prove two fractional weakenings of the same statement for arbitrary 3-uniform hypergraphs. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.dam.2010.05.027 | Discrete Applied Mathematics |
Keywords | Field | DocType |
pairwise edge-disjoint copy,simplicial complexes,planar graph,geometric realization,covering,d-uniform hypergraph,packing,set c,maximum size,fractional weakenings,3-uniform hypergraphs,complete subhypergraph k,simplicial complex | Discrete mathematics,Combinatorics,Hypergraph,Constraint graph,Tetrahedron,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
161 | 9 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. K. Ghosh | 1 | 10 | 1.01 |
| P. E. Haxell | 2 | 212 | 26.40 |