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 vertices with odd degree (the handshaking lemma).Hagit Attiya...
This paper presents an elementary, non-topological impossibility proof of k -set agreement. The proof depends on two simple properties of the immediate snapshot executions , a subset of all possible executions, and on the well known handshaking lemma stating that every graph has an even number ...