Swart's P=NP Paper: Tracking Down the Bug?

Thread View: net.research

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Kenneth Steiglitz Sun, 30 Mar 1986 06:38

#138

Author: Kenneth Steiglitz
Date: Sun, 30 Mar 1986 06:38

18 lines
1191 bytes

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.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads