Replacing a graph clasper by tree claspers
arXiv:math/0510459
Abstract
We prove that two links related by a surgery along a connected, strict graph clasper of degree n are C_n-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.
4 pages, 3 figures