跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20287 · v1

Structural properties of semi-cutting sets

首次提交 2026-11-16 06:34
版本更新 2026-11-16 06:34
雷达观测 2026-11-17 17:12
arXiv ↗PDF ↗

摘要

Let G=(V,E)G=(V,E) be a finite simple undirected graph, let T⊆VT\subseteq V, and let F⊆EF\subseteq E. We call FF semi-cutting for TT if dG(u,w)<dG∖F(u,w)d_{G}(u,w)<d_{G\setminus F}(u,w) for every two distinct terminals u,w∈Tu,w\in T. We prove the sharp bound ∣F∣≥∣T∣−1|F|\ge |T|-1. The argument is structural: semi-cutting sets are first identified with edge transversals of all shortest terminal-terminal paths, and the bound then follows from a contraction step, a terminal-deletion lemma, and a lexicographic induction on (∣T∣,∣V∣)(|T|,|V|).

作者备注:7 pages, 4 figures

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-16 06:34 · 最新观测版本

Structural properties of semi-cutting sets

Let G=(V,E)G=(V,E) be a finite simple undirected graph, let T⊆VT\subseteq V, and let F⊆EF\subseteq E. We call FF semi-cutting for TT if dG(u,w)<dG∖F(u,w)d_{G}(u,w)<d_{G\setminus F}(u,w) for every two distinct terminals u,w∈Tu,w\in T. We prove the sharp bound ∣F∣≥∣T∣−1|F|\ge |T|-1. The argument is structural: semi-cutting sets are first identified with edge transversals of all shortest terminal-terminal paths, and the bound then follows from a contraction step, a terminal-deletion lemma, and a lexicographic induction on (∣T∣,∣V∣)(|T|,|V|).

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