摘要

We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.

  • 出版日期2014-12

全文