How to approach the proof of this formula for triangulations. I am currently working on an assignment for my discrete mathematics lecture.
It is specifically about graphs which are triangulations and have a minimum degree of 3. Triangulation specifically means here, that every area in the graph is bordered by exactly 3 edges.
The formula that is to be proven is the following:
Let $v_i$ be the number of vertices of degree $i$. Show that the following is true:
$3 v_3 + 2 v_4 + v_5 = v_7 + 2 v_8 + 3 v_9 + ... + (X - 6) v_X + 12$
Whereas $X$ is the maximum degree of the graph in question.
Now, I am specifically supposed to use the Euler Formula, that is
$|V| - |E| + g = 2$
I can also calculate the number of edges and areas relative to each other, as I know that every area is bordered by 3 edges and every edge is the border between 2 areas. That means that I know that $3|E| = 2g$.
But I don't know how to go on from here. I specifically struggle with the fact, the the formula doesn't just count vertices, but also differentiates them based on their degree. I don't see how to get there from the Euler formula. I would appreciate any tips that could lead me into the right direction!
Thanks for reading!
Edit:
I have just now realized, that the graph is maximally planar, being a triangulation. Now I can use the fact that $|E| = 3|V| - 6$, but I am not sure where that leads me. I feel like the $-6$ in there might be useful to get to the formula from above, but I can't seem to make the connection, if it even is actually there.

If you take all the terms to one side, you get
$$-3v_3-2v_4-v_5+v_7+\cdots+(X-6)v_X+12.$$
This can be expessed as
$$\sum_{i=3}^{X}(i-6)v_i+12,$$
i.e. every vertex $v$ counts for $d(v)-6$ in the sum. Now use the fact that the sum of the degrees is twice the number of edges.
