3 problems

Let $H$ be a graph with at least one edge. A subdivision of $H$ is obtained by replacing edges of $H$ with pairwise internally vertex-disjoint paths; let $\operatorname{Sub}(H)$ be…

Let $G$ be a graph on $n$ vertices. A path separating system of $G$ is a collection of paths in $G$ such that, for every ordered pair of distinct edges $(e,f)$, some path contains…

Let $G$ be a graph on $n$ vertices. A separating path system is a collection of paths in $G$ that separates the edges of $G$, either weakly or strongly. Linear-size separating path…