Separating edges by linearly many subdivisions
Combinatorics
2025-06-18 v1
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.
Keywords
Cite
@article{arxiv.2506.14011,
title = {Separating edges by linearly many subdivisions},
author = {George Kontogeorgiou and Matias Pavez-Signe and Maya Stein and S Taruni and Ana Trujillo-Negrete},
journal= {arXiv preprint arXiv:2506.14011},
year = {2025}
}
Comments
12 pages, 5 figures