Separating path systems
Combinatorics
2016-09-07 v2
Abstract
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every -vertex graph admits a separating path system of size and prove this in certain interesting special cases. In particular, we establish this conjecture for random graphs and graphs with linear minimum degree. We also obtain tight bounds on the size of a minimal separating path system in the case of trees.
Keywords
Cite
@article{arxiv.1311.5051,
title = {Separating path systems},
author = {Victor Falgas-Ravry and Teeradej Kittipassorn and Dániel Korándi and Shoham Letzter and Bhargav Narayanan},
journal= {arXiv preprint arXiv:1311.5051},
year = {2016}
}
Comments
21 pages, fixed misprints, Journal of Combinatorics