no. 16 · Tuesday 17 November 2026
Structural properties of semi-cutting sets
Abstract
Let $G=(V,E)$ be a finite simple undirected graph, let $T\subseteq V$, and let $F\subseteq E$. We call $F$ semi-cutting for $T$ if $d_{G}(u,w)<d_{G\setminus F}(u,w)$ for every two distinct terminals $u,w\in T$. We prove the sharp bound $|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|)$.
- comments
- 7 pages, 4 figures
- fields
- Combinatorics