Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site princeton.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!ken
From: ken@princeton.UUCP (Kenneth Steiglitz)
Newsgroups: net.research,net.math
Subject: Swart's P=NP Paper: Tracking Down the Bug?
Message-ID: <1262@princeton.UUCP>
Date: Sun, 30-Mar-86 01:38:21 EST
Article-I.D.: princeto.1262
Posted: Sun Mar 30 01:38:21 1986
Date-Received: Tue, 1-Apr-86 05:16:14 EST
Reply-To: ken@princeton.UUCP (Kenneth Steiglitz)
Organization: Princeton University EECS Dept
Lines: 16
Xref: watmath net.research:445 net.math:3022

Keywords:


I've been trying to read E. R. Swart's paper,
"P = NP", University of Guelph Research Report
CIS86-02, Feb. 1986, which has been mentioned
here. The first part of the argument that gives
me pause is on p. 19, proof of Lemma 5.3:

"Then it is a simple matter to find a proper
path of length n through the graph from vertex
0=n back to vertex n by following successive
flows through adjacent vertices."

Can someone who is also reading the paper explain
why there must be such a path? Shall I go on reading?
Any help or hints will be greatly appreciated.
Thanks.