← 研踪 PaperTrailarXiv: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
摘要
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.
作者备注:13 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-13 04:24 · 最新观测版本
Isolation of $k$-cliques in uniform hypergraphs
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.
查看此版本解读 →查看此版本原文 ↗