Comportement \`a l'infini du graphe gordien des n\oe{}uds
Geometric Topology
2007-05-23 v1
Abstract
We study the gordian graph of all knots in : 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.
Cite
@article{arxiv.math/0503143,
title = {Comportement \`a l'infini du graphe gordien des n\oe{}uds},
author = {Julien Marche},
journal= {arXiv preprint arXiv:math/0503143},
year = {2007}
}
Comments
6 pages, 6 figures