Graphs with at most two trees in a forest building process

Steve Butler, Misa Hamanaka, Marie Hardt

Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The…