Year: 2026
Type: preprint
Abstract: An isolating set of a hypergraph $H$ is a vertex set whose closed neighbourhood intersects every edge of $H$. The isolation number $ι(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 $ι(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)ι(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.
Source: arXiv (Cornell University)
Authors: Li, Minhui, Zhang, Shumin, Qu, Junhao
Institutions: Qinghai Institute of Technology, Qinghai Normal University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236559564
