Paragraph

  1. Find a subgraph with the smallest number of edges that is still connected and contains all the vertices.

  2. Find a subgraph with the largest number of edges that doesn't contain any cycles.

  3. What do you notice about the number of edges in your examples above? Is this a coincidence?

in-context