Comportement à l'infini du graphe gordien des nœuds

Simple item page
dc.creatorMarche, Julien
dc.date2005-03-08
dc.date.accessioned2026-07-07T05:17:46Z
dc.date.available2026-07-07T05:17:46Z
dc.descriptionWe study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement of any finite subset is connected.
dc.description6 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/math/0503143
dc.identifierhttp://arxiv.org/abs/math/0503143
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74427
dc.subjectGeometric Topology
dc.subject57M27
dc.titleComportement à l'infini du graphe gordien des nœuds
dc.typetext

Files

Collections

arXiv