User blog:Alemagno12/A well-ordering of graphs

Forests only (up to SVO)

 * Empty graph = 0
 * 1 vertex = 1
 * 2 vertices = 2
 * 3 vertices = 3
 * n vertices = n
 * 1 stick = ω
 * 1 stick + vertex = ω+1
 * 1 stick + n vertices = ω+n
 * 2 sticks = ω2
 * 2 sticks + vertex = ω2+1
 * 3 sticks = ω3
 * n sticks = ωn
 * 3-path = ω2
 * 3-path + stick = ω2+ω
 * 2 3-paths = ω22
 * 3 3-paths = ω23
 * 4-path = ω3
 * 2 4-paths = ω32
 * 5-path = ω4
 * (n+1)-path = ωn
 * [WIP]