betaFeedback

WorksMathematics

Isolation of kk-cliques in uniform hypergraphs

Abstract

A copy of a hypergraph FF is called an FF-copy. For any integers kk and rr with 2≤r≤k2 \leq r \leq k, let KkrK_k^r denote the complete rr-uniform hypergraph whose vertex set is [k]={1,2,…,k}[k] = \{1, 2, \dots, k\} (that is, the edges of KkrK_k^r are the rr-element subsets of [k][k]). Given an rr-uniform mm-edge hypergraph HH, the KkrK_k^r-isolation number of HH, denoted by ι(H,Kkr)ι(H, K_k^r), is the size of a smallest subset DD of the vertex set of HH such that the closed neighbourhood N[D]N[D] of DD intersects the vertex sets of the KkrK_k^r-copies contained by HH (equivalently, H−N[D]H-N[D] contains no KkrK_k^r-copy). We prove that if HH is connected and not a KkrK_k^r-copy, then ι(H,Kkr)≤⌊(r−1)m+1(r−1)((kr)+1)+1⌋.ι(H, K^r_k) \le \left \lfloor \frac{(r-1)m + 1}{(r-1)(\binom{k}{r}+1) + 1} \right \rfloor. The bound is best possible. This is a solution to a problem of Li, Zhang and Ye. We also provide an alternative proof for r<kr < k. Both proofs introduce new ideas for establishing bounds on isolation parameters.

Paper details

vlnc:W_jfarrm2x
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…