Talk:Hamiltonian path

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Start Class	Mid Priority	Field: Discrete mathematics
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Close to B-Class. Needs some expansion. [[User:FLAVIO MORENO 23:01, 04 Febrero 2008 (UTC) Puente entre el 4ct y el cy H La B#3 establecida por V.V.VOLINSKI, PARA LA SOLUCION DEL 4CT, COMO SU EQUIVALENTE, CONDUJO A LA SOLUCION DEL 4CT SIN EL USO DE LA COMPUTADORA PASANDO POR ESCILA Y CARIBDIS LLEGO A PUERTO TRAYENDO LA NOTICIA DE L CY-H PEREGRINA NOTICIA QUE DECIA QUE : EL CY-H ES UNA RUTA BINARIA MONOCYCLICA DE AQUÍ SALE LA CONJETURA : TODO N TIENE CY-H ESTA CONJETURA HA IDO CRECIENDO, COMO CRECE LA SOMBRA CUANDO EL SOL DECLINA ESTE PUENTE ESTABLECIDO ENTRE EL 4CT Y EL CY-H SERA LA FUENTE DE ESTE TRABAJO ESTE TRABAJO CONSTA DE 3 PARTES : 1ª ) INTRODUCCION 2ª ) CY-H 3ª ) APOLOGIA Flavio Moreno Lima - Perú www.logicadiagramatica.com

[edit] Icosian Calculus

A conception of a system, or family of systems, of non-commutative roots of unity for geometrical interpretation. Icosian Calculus involves roots with different exponents and not requiring the distributive property of multiplication. In these calculuations, values entering only as connecting exponents and not as connecting terms.

• [to be finished;]
• [solutions of hamilitonian circuits]

above stuff deleted from main page since it doesn't have much to do with Hamiltonian paths. Populus 19:21, 11 Sep 2003 (UTC)

doesn't have much to do with?

Hamilton Icosian Calculus used to investigate closed edge paths on a dodecahedron that visit each vertex exactly once.

http://www.maths.tcd.ie/pub/HistMath/People/Hamilton/Icosian/

I think it might make more sense to talk about this as part of the history, since Hamilton's icosian calculus doesn't have much to do with the hamiltionian path problem as studied today. I will try to come up with something. Populus 20:26, 11 Sep 2003 (UTC)

• Hamiltonian Circuit Experiment Program - Offer prize of one million dollars promised to those who solve the seven problems unsolved at the end of 20th century, one being the NP-Complete Problem which would solve the "Hamiltonian Circuit Problem".

dumping this link too---it's actually a would-be program for finding Hamiltonian paths that hasn't been updated in a while Populus 19:28, 11 Sep 2003 (UTC)

[edit] Separated article

I separated Hamiltonian path and Hamiltonian path problem. Although they are related, I think it is clearer to put them on separate pages. MathMartin 17:58, 24 Jan 2005 (UTC)

[edit] Rudrata path

Some authors (notably, Dasgupta, Papadimitriou, & Vazirani in their Algorithms, 2006) call the Hamilton path the "Rudrata path" after the Kashmiri poet Rudrata who originated the concept of the knight's tour on a chessboard. I don't think this term is widespread enough yet to be worth including in the article, but it may be worth thinking about in future. Gdr 11:57, 10 April 2007 (UTC)

[edit] Better example image

I think we might need a better example image - at first I just stared at the image unsure what to look for. After refreshing my memory I noticed that the black line was actually the path travelled. I slighly updated the description, but I think we need a better example here. CharonX/talk 19:32, 14 April 2007 (UTC)

I added an example I found on the German Wikipedia article. Maybe the other one should be removed, it seems somewhat hard to follow. Arthena^(talk) 21:45, 26 October 2007 (UTC)

[edit] Contradiction: Tournaments

Why does this article seem to contradict itself?

"every [[tournament] has an odd number of Hamiltonian paths"

"A tournament (with more than 2 vertices) is Hamiltonian if and only if it is strongly connected."

These statements do not seem to agree. --AlanH (talk) 18:40, 22 February 2008 (UTC)