just for that, it's two hours W.O.O.
theoriginalsteve <this space intentionally left blank>,
Mon 1 Feb 2010, 13:15,
archived)
hahait spells woo! :D
Uncle Arnie will fry them with his hex vision!!
(Uncle Arnie will fry them with his hex vision!!
Victor Meldrew,
Mon 1 Feb 2010, 13:30,
archived)
And vice-versa. QED. The Alchemist king of the needlessly complicated,
Mon 1 Feb 2010, 13:06,
archived)
Oh. Ok.So instead I will prove that no simple graph exists whose degree partition is discrete:
Firstly, assume that it does exist. Now, sort the vertices according to their degree. Note that the nth vertex can have a maximum of (n-1) bonds to the others. However, this only leaves (n - 2) other possible degrees for the remaining (n - 1) vertices, so two of the remaining vertices must share the same degree.
Q. E. Fucking D.
(Firstly, assume that it does exist. Now, sort the vertices according to their degree. Note that the nth vertex can have a maximum of (n-1) bonds to the others. However, this only leaves (n - 2) other possible degrees for the remaining (n - 1) vertices, so two of the remaining vertices must share the same degree.
Q. E. Fucking D.
The Alchemist king of the needlessly complicated,
Mon 1 Feb 2010, 13:14,
archived)
No idea what you just said. So you didn't prove anything to me. Mu Dinofiddler,
Mon 1 Feb 2010, 13:18,
archived)
POTATOBOTS TRANSFORM!!
prodigy69 broke b3ta and made everyone leave,
Mon 1 Feb 2010, 13:16,
archived)
Ha, that's a cheap-ass toy. The Alchemist king of the needlessly complicated,
Mon 1 Feb 2010, 13:22,
archived)
