most citedIntrinsic knotting and linking of almost complete graphs

7 citations · 7 across the 1 of their papers we have counts for

collaborators

1 paper

math.GT2007★ 7 cited

Intrinsic knotting and linking of almost complete graphs

J. Campbell, T. W. Mattman, R. Ottman +3

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at lea…