|
|
|
|
|Store|
|
|
|
|
CTK Exchange
sfwc
Member since Jun-19-03
|
Jun-28-05, 08:23 AM (EST) |
|
"Theorem of Wilson."
|
The theorem of Wilson generalising the solution to the fifteen puzzle appears to have a problem. In particular, consider any nonbipartite graph G with a node N such that removal of N disconnects G. Then evidently puz(G) is not connected. For example, consider the graph A which looks like a letter A. puz(A) has 12 connected components. It appears that if you include the condition that removal of any node leaves the graph connected then the theorem is saved. Thankyou sfwc <>< |
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
You may be curious to have a look at the old CTK Exchange archive. Please do not post there.
|Front page|
|Contents|
Copyright © 1996-2018 Alexander Bogomolny
|
|