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 $\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...