Counting links and knots in complete graphs

DOI10.3836/tjm/1391177980zbMath1285.05036arXiv1008.1085OpenAlexW2082494397MaRDI QIDQ2444958

Lowell Trott, Blake Mellor, Loren Abrams

Publication date: 11 April 2014

Published in: Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.1085

zbMATH Keywords

spatial graphsintrinsically knotted graphsintrinsically linked graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Intrinsically knotted and 4-linked directed graphs ⋮ Capturing links in spatial complete graphs ⋮ Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs ⋮ Intrinsic linking and knotting in tournaments ⋮ Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs

Uses Software

• KnotInfo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting links in complete graphs
• Intrinsic knotting and linking of complete graphs
• Sachs' linkless embedding conjecture
• △Y-EXCHANGES AND THE CONWAY–GORDON THEOREMS
• Knots and links in spatial graphs
• More intrinsically knotted graphs
• Intrinsic linking and knotting are arbitrarily complex
• IMPROVED LOWER BOUND FOR THE NUMBER OF KNOTTED HAMILTONIAN CYCLES IN SPATIAL EMBEDDINGS OF COMPLETE GRAPHS
• Intrinsically knotted graphs
• A newly recognized intrinsically knotted graph
• INTRINSICALLY n-LINKED GRAPHS
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS