Which of these is a necessary property for a graph to be a forest?
It must be connected.
It must have exactly V−1V-1V−1 edges.
Every subgraph must be acyclic.
It must contain at least one cycle.