A graph \(F\) is a forest if and only if between any pair of vertices in \(F\) there is at most one path.