The isolation number of uniform hypertrees

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24477
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The isolation number of uniform hypertrees

Minhui Li, Junhao Qu, Shumin Zhang
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

The isolation number of uniform hypertrees

Minhui Li, Junhao Qu, Shumin Zhang
preprint en

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.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon