Separating path systems

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 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.Comment: 21 pages, fixed misprints, Journal of Combinatoric

Bifurcation diagram for saddle/source bimodal linear dynamical systems

We continue the study of the structural stability and the bifurcations of planar bimodal linear dynamical systems (BLDS) (that is, systems consisting of two linear dynamics acting on each side of a straight line, assuming continuity along the separating line). Here, we enlarge the study of the bifurcation diagram of saddle/spiral BLDS to saddle/source BLDS and in particular we study the position of the homoclinic bifurcation with regard to the new improper node bifurcationPostprint (published version