User blog comment:Meowzz/TREE(3) vs SCG(2) which is bigger?/@comment-11227630-20180322052213

TREE(4) < SCG(3)

TREE(TREE(3)) < SCG(3)

TREE(TREE(...TREE(3)...)) (with TREE(3) TREE's) < SCG(3)

Colored trees can be embedded into subcubic graphs without the diamond graph as minor. And, we can make beginning of sequence such that the graphs have the diamond graph as minor, which means that the sequence for SCG(3) can have a large part without restricted in "subcubic graphs without the diamond graph as minor", i.e. a large part beyond TREE.