Separating Path Systems of Size at most $7.75n$

Daniel W. Cranston, Jared Noyman, Gexin Yu

A family of paths in a graph $G$ strongly separates the edges of $G$ if for every ordered pair of distinct edges $(e,f)$ some path in the family contains $e$ and avoids $f$; the mi…