WorksMathematics
Isolation of -cliques in uniform hypergraphs
Abstract
A copy of a hypergraph is called an -copy. For any integers and with , let denote the complete -uniform hypergraph whose vertex set is (that is, the edges of are the -element subsets of ). Given an -uniform -edge hypergraph , the -isolation number of , denoted by , is the size of a smallest subset of the vertex set of such that the closed neighbourhood of intersects the vertex sets of the -copies contained by (equivalently, contains no -copy). We prove that if is connected and not a -copy, then The bound is best possible. This is a solution to a problem of Li, Zhang and Ye. We also provide an alternative proof for . Both proofs introduce new ideas for establishing bounds on isolation parameters.