4 Feb
2005
4 Feb
'05
1:44 p.m.
On Thu, 3 Feb 2005 19:48:25 -0800, Steve Gray <stevebg@adelphia.net> wrote:
Very nice. You might have mentioned the situation where the path you just created did not visit some vertices at all, but that does not invalidate the argument.
I'm not sure where a mention would fit into the argument, actually. If your path is not yet complete, then there must be *some* vertex that has both included and excluded edges -- that's what the graph being connected means. But there may (or may not) be lots of vertices that have only path edges, and lots that have only non-path edges, and neither of those types plays any role in the construction. --Michael Kleber -- It is very dark and after 2000. If you continue you are likely to be eaten by a bleen.