Graph Theory 11: Characterizing Trees

I prove that the following are equivalent for a graph T: (i) T is a tree (ii) Any two vertices in T are connected by a unique path (iii) T is minimally connected (iv) T is maximally acyclic