Comportement \`a l'infini du graphe gordien des n\oe{}uds

Publication date 8 March 2005

Abstract: We 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.

This page was built for publication: Comportement \`a l'infini du graphe gordien des n\oe{}uds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475211)