Planar graphs; geometric and topological aspects of graph theory (05C10) Transversal (matching) theory (05D15) Combinatorial aspects of simplicial complexes (05E45) Helly-type theorems and geometric transversal theory (52A35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)
Abstract: A stacked -sphere is the boundary complex of a stacked -ball, which is obtained by taking cone over a free -face repeatedly from a -simplex. A stacked sphere is called linear if every cone is taken over a face added in the previous step. In this paper, we study the transversal number of facets of stacked -spheres, denoted by , which is the minimum number of vertices intersecting with all facets. Briggs, Dobbins and Lee showed that the transversal ratio of a stacked -sphere is bounded above by and can be as large as . We improve the lower bound by constructing linear stacked -spheres with transversal ratio and general stacked -spheres with transversal ratio . Finally, we show that is optimal for linear stacked -spheres, that is, the transversal ratio is at most for linear stacked -spheres.
Recommendations
Cited in
(2)
This page was built for publication: Transversal numbers of stacked spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6436658)