Graph Theorymedium
0:00.0

Let GG be a graph with V=7V=7 vertices. What is the maximum number of edges GG can have such that it remains a forest (acyclic)?