Prove AlgorithmicThinTrees (openai/math family 174: Deterministic construction of strong thin spanning…
Prove AlgorithmicThinTrees (openai/math family 174: Deterministic construction of strong thin spanning…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 174 of the release, Deterministic construction of strong thin spanning trees…
The task
Context: this statement belongs to family 174 of the release, *Deterministic construction of strong thin spanning trees* (Combinatorics). The family as a whole: Resolves the strong thin-tree conjecture constructively. Every finite loopless $k$-edge-connected multigraph on at least two vertices has a spanning tree…
Part of raising-heart/openai-math.