Labeling a triangulated sphere Divide the 1-dimensional sphere $S^1$ into arcs. 
Label each vertex between two arcs as either 1 or 2. 
Count the number of "full arcs" - arcs with both 1 and 2 at their endpoints. 
Divide these full arcs to two kinds: "positive" (1-2 going clockwise) and "negative" (2-1).
Then, it is clear that the number of positive full arcs equals the number of negative full arcs: each time we go from 1 to 2, we must at some point go back from 2 to 1, since we are on a circle.

Is the following generalization to multi-dimensional spheres correct?

Triangulate the $n$-dimensional sphere $S^n$.
Label each vertex of the triangulation by a label from $\{1,\ldots,n+1\}$.
Count the number of "full simplices" - simplices with all $n+1$ different labels at their vertices.
Divide labeled simplices into two equivalence classes: "positive" and "negative", such that for each two simplices in the same class, there is an orientation-preserving map from one to the other agreeing on the labels. To relabel a simplex keeping it in the same class, we can perform any even permutation on the labels (for example, if a simplex labeled 1-2-3-4 is positive, then the simplex labeled 2-3-1-4 is also positive, but the simplex labeled 2-1-3-4 is negative). 

Conjecture: the number of positive simplices equals the number of negative simplices.

Is this conjecture correct?
Note: asked in math.SE with no replies
 A: The labeling gives a piecewise linear map from $S^n$ to a simplex $\Delta$ with $n+1$ vertices, where label $k$ means the point is sent to vertex $v_k$, and we extend linearly on simplices. The map must have degree $0$ because $\Delta$ is contractible. The degree can be computed from the preimage of any point in the interior of $\Delta$, and it is the difference between the number of positive simplices and the number of negative simplices. 
A: Let me point out that this also admits a purely combinatorial proof. Consider your triangulated $S^n$ as the boundary of a triangulated ball $B^{n+1}$ (for example, but not necessarily, cone your triangulated sphere to a vertex in the interior of the ball) and extend your labeling of the vertices to the interior arbitrarily (in the example, simply choose a label in $\{1,\dots,n+1\}$ for the interior point).
Now, each $(n+1)$-simplex $\sigma$ in your triangulated ball that uses all $n+1$ labels has exactly two $n$-dimensional faces $\tau_1$ and $\tau_2$ that use all labels, and $\tau_1$ and $\tau_2$ have opposite orientations when seen from $\sigma$. If you now count the pairs $(\sigma,\tau)$ that arise this way (with their orientations), the $\tau$'s intersecting the interior of the ball cancel out (they belong to two $\sigma$'s, with opposite orientations) so that in the boundary there must be the same number of them with one and the other orientation.
(This proof is very much inspired in "Sperner's Lemma", which Sperner used to give a purely combinatorial proof of Brower's fixed point theorem)
