Kruskal's algorithm
Minimality

We show that the following proposition P is true by induction: If F is the set of edges chosen at any stage of the algorithm, then there is some minimum spanning tree that contains F and none of the edges rejected by the algorithm.
oulipo:avoid_letter[e], detectable_format:multiple_sections[3]