Show that if there are r trees in the forest at some
Chapter , Problem 29E(choose chapter or problem)
Problem 29E
Show that if there are r trees in the forest at some intermediate step of Sollin’s algorithm, then at least [r/2] edges are added by the next iteration of the algorithm.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer