Separating edges by linearly many subdivisions
arXiv:2506.14011
Abstract
We prove that for any two graphs and , the edges of can be strongly separated by a collection of linearly many subdivisions of and single edges. This confirms a conjecture of Botler and Naia.
12 pages, 5 figures