ON THE SIZE OF LINKS IN Kn, n, Kn, n, 1, AND Kn

DOI10.1142/S0218216502001536zbMath0996.57001MaRDI QIDQ4541083

No author found.

Publication date: 30 July 2002

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

zbMATH Keywords

complete graphsspatial graphsintrinsically linked

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (6)

INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS ⋮ Counting links and knots in complete graphs ⋮ A note on semifield planes admitting irreducible planar Baer collineations ⋮ Counting links in complete graphs ⋮ Intrinsically linked graphs and even linking number ⋮ Knots and links in spatial graphs: a survey

Cites Work

• Sachs' linkless embedding conjecture

This page was built for publication: ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n