Separating the edges of a graph by a linear number of paths
share
Recently, Letzter proved that any graph of order n contains a collection 𝒫 of O(nlog^⋆ n) paths with the following property: for all distinct edges e and f there exists a path in 𝒫 which contains e but not f. We improve this upper bound to 19 n, thus answering a question of Katona and confirming a conjecture independently posed by Balogh, Csaba, Martin, and Pluhár and by Falgas-Ravry, Kittipassorn, Korándi, Letzter, and Narayanan. Our proof is elementary and self-contained.
READ FULL TEXT