The proof depends on two simple properties of the immediate snapshot executions, a subset of all possible executions, and on the well known graph theory result stating that every graph has an even number of ver
The handshaking lemma is a consequence of the degree sum formula, according to which the sum of the degrees (the numbers of times each vertex is touched) equals twice the number of edges N in the graph. Specifically, this means that, in the apriorics n = 6 case, we have the ...