Minimal spanning trees
James H. Schmerl · Proceedings of the American Mathematical Society · 2003
The main result is that a recursive weighted graph having a minimal spanning tree has a minimal spanning tree that is Δ 2 0 \Delta ^0_2 . This leads to a proof of the failure of a conjecture of Clote and Hirst (1998) concerning Reverse Mathematics and minimal spanning trees.