  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.
