User blog comment:Wythagoras/New bound for SSCG(2)/@comment-5529393-20130714151318/@comment-1605058-20130714164446

It can be easily shown that G5 and further must be path forests. Because of this Goucher's greedy algorithm is very likely optimal.