$Δ$-Y Moves and Partial Steiner Systems

We study graph systems generated by $Δ$-Y and Y-$Δ$ moves and prove that, for initial graphs of minimum degree at least $7$, $Δ$-Y moves alone generate every reachable graph. As a consequence, for $n\ge 8$, the $Δ$-Y system generated from the complete graph of $n$ vertices is canonically isomorphic