← 研踪 PaperTrailarXiv:2611.20287 · v1
Structural properties of semi-cutting sets
首次提交 2026-11-16 06:34
版本更新 2026-11-16 06:34
雷达观测 2026-11-17 17:12
摘要
Let be a finite simple undirected graph, let , and let . We call semi-cutting for if for every two distinct terminals . We prove the sharp bound . 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 .
作者备注:7 pages, 4 figures
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 06:34 · 最新观测版本
Structural properties of semi-cutting sets
Let be a finite simple undirected graph, let , and let . We call semi-cutting for if for every two distinct terminals . We prove the sharp bound . 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 .
查看此版本解读 →查看此版本原文 ↗