Comportement à l'infini du graphe gordien des nœuds
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。