Separating the edges of a graph by a linear number of paths

Marthe Bonamy, Fábio Botler, François Dross +2

Recently, Letzter proved that any graph of order $n$ contains a collection $\mathcal{P}$ of $O(n{\log }^{\star }n)$ paths with the following property: for all distinct edges $e$ and $f$…