On the path separation number of graphs

József Balogh, Béla Csaba, Ryan R. Martin +1

A path separator of a graph $G$ is a set of paths $\mathcal{P}=\{P_1,\dots ,P_t\}$ such that for every pair of edges $e,f\in E(G)$, there exist paths $P_e,P_f\in \mathcal{P}$ such t…