跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17489 · v1

Isolation of $k$-cliques in uniform hypergraphs

首次提交 2026-11-13 04:24
版本更新 2026-11-13 04:24
雷达观测 2026-11-17 04:58
arXiv ↗PDF ↗

摘要

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.

作者备注:13 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 04:24 · 最新观测版本

Isolation of $k$-cliques in uniform hypergraphs

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.

查看此版本解读 →查看此版本原文 ↗