跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 04:21 — 2026-11-21 04:21(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.19361

Distance-$2$ isolation of connected graphs

Peter Borg, Pawaton Kaemawichanurat

原文摘要

If $\mathcal{F}$ is a set of graphs and $F$ is a copy of a graph in $\mathcal{F}$, then we call $F$ an $\mathcal{F}$-graph. Let $G$ be a connected $n$-vertex graph. For a subset $D$ of the vertex set $V(G)$, let $N^2[D]$ denote the second closed neighbourhood of $D$. Let $ι_2(G, \mathcal{F})$ denote the size of a smallest subset $D$ of $V(G)$ such that $N^2[D]$ intersects the $\mathcal{F}$-graphs contained by $G$ (equivalently, $G - N^2[G]$ contains no $\mathcal{F}$-graph). For $k \geq 0$, let $\mathcal{E}_k$ denote the set of connected graphs that have at least $k$ edges (and at least one vertex if $k = 0$). By a well-known result of Meir and Moon, $ι_2(G, \mathcal{E}_0) \leq n/3$ if $n \geq 3$. We show that $ι_2(G, \mathcal{E}_1) \leq n/4$ if $n \neq 2$, $n \neq 3$ and $G$ is not a $7$-cycle. Hua and Liu recently showed that if $G$ is not a $4$-vertex path or a $4$-cycle or a $9$-cycle, then there exists a subset $D$ of $V(G)$ such that $|D| \leq n/5$ and each component of $G-N^2[D]$ has a universal vertex. We strengthen this result by showing that $ι_2(G, \mathcal{E}_2) \leq n/5$ if $n \neq 3$, $n \neq 4$ and $G$ is not an $8$-cycle or one of five $9$-vertex graphs. It follows that $ι_2(G, \mathcal{E}_3) \leq n/5$ if $G$ is not a $3$-cycle or a $4$-vertex graph or a $9$-cycle. This also implies the result of Hua and Liu, and that if $\mathcal{C}$ is the set of cycles, then $ι_2(G, \mathcal{C}) \leq n/5$ unless $G$ is a $3$-cycle or a $4$-vertex graph containing a cycle. All these bounds are sharp.

math.CO · cs.DM

新论文 · v1arXiv:2611.17489

Isolation of $k$-cliques in uniform hypergraphs

Mattea Baluci, Peter Borg

原文摘要

A copy of a hypergraph $F$ is called an $F$-copy. For any integers $k$ and $r$ with $2 \leq r \leq k$, let $K_k^r$ denote the complete $r$-uniform hypergraph whose vertex set is $[k] = \{1, 2, \dots, k\}$ (that is, the edges of $K_k^r$ are the $r$-element subsets of $[k]$). Given an $r$-uniform $m$-edge hypergraph $H$, the $K_k^r$-isolation number of $H$, denoted by $ι(H, K_k^r)$, is the size of a smallest subset $D$ of the vertex set of $H$ such that the closed neighbourhood $N[D]$ of $D$ intersects the vertex sets of the $K_k^r$-copies contained by $H$ (equivalently, $H-N[D]$ contains no $K_k^r$-copy). We prove that if $H$ is connected and not a $K_k^r$-copy, then $$ι(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 < k$. Both proofs introduce new ideas for establishing bounds on isolation parameters.

math.CO · cs.DM