Separating path systems
Published in arXiv (Cornell University) • Nov 20, 2013
NobleIDNI2P69W89R93S58
Authors:,,
Victor Falgas‐Ravry
Teeradej Kittipassorn
Dániel Korándi
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 $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special cases. In particular, we establish this conjecture for rand...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!