User blog:Ynought/Trying to make the SCG function even quicker

So the original definition is the length of:

Given an integer k, suppose we have a sequence of subcubic graphs G1, G2, ... such that each graph Gihas at most i + k vertices and for no i < j is Gi homeomorphically embeddable into Gj (i.e. is a graph minor).

well that thing with the homeomorhpically embeddable thats what is holding it back.first lets define \(k\) minor as embedable while meving at most \(k\) vertices/edges

so my new definition of the SCG function is :

Given an integer k, suppose we have a sequence of subcubic graphs G1, G2, ... such that each graph Gihas at most i + k vertices and for no i < j is Gi  i minor into Gj

if you wanted you could replace k with SCG(k-1) but i dont think that is necessary