Skip to content
Preprint

The isolation number of uniform hypertrees

Nov 2026 · 0 citations · 8 references
Mathematics

Abstract

An isolating set of a hypergraph $H$ is a vertex set whose closed neighbourhood intersects every edge of $H$. The isolation number $\iota(H)$ is the minimum cardinality of such a set. Let $r\ge3$, and let $T$ be an $r$-uniform hypergraph whose incidence graph is a tree. We prove that, if $T$ has order $n$ and at least two edges, then $\iota(T)\le\lfloor n/(2r-1)\rfloor$. The bound is attained at every admissible order. We characterize all hypertrees attaining it by a construction using six types of marked hypertrees of orders $2r-1$, $3r-2$ and $4r-3$. The proof uses a packing formula for the isolation number and an exact identity for the difference $n-(2r-1)\iota(T)$. For connected graphs of order $n$ with at least two blocks, all of which are triangles, we obtain the sharp bound $\lfloor n/5\rfloor$ on the cycle isolation number and characterize the graphs attaining it.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.