Counting links in complete graphs

zbMath1163.05008arXivmath/0611626MaRDI QIDQ1012051

Blake Mellor, Thomas R. Fleming

Publication date: 14 April 2009

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

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

zbMATH Keywords

book embeddingsembedding in spacegraphs on seven verticesminimal linking embeddingsnon-trivial links

Mathematics Subject Classification ID

Related Items (10)

Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\) ⋮ Intrinsically knotted and 4-linked directed graphs ⋮ Capturing links in spatial complete graphs ⋮ Classifying intrinsically linked tournaments by score sequence ⋮ Counting links and knots in complete graphs ⋮ Recent developments in spatial graph theory ⋮ 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 ⋮ A refinement of the Conway-Gordon theorems

Cites Work

• Unnamed Item
• Average distribution of certain arithmetic functions on the set of integers without large prime factors
• The book thickness of a graph
• On the pagenumber of complete bipartite graphs
• Intrinsic knotting and linking of complete graphs
• Sachs' linkless embedding conjecture
• Knots and links in certain spatial complete graphs
• Intrinsic linking and knotting in virtual spatial graphs
• Intrinsically linked graphs and even linking number
• Knots and links in spatial graphs
• Intrinsic linking and knotting are arbitrarily complex
• Pagenumber of complete bipartite graphs
• INTRINSICALLY n-LINKED GRAPHS
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n

This page was built for publication: Counting links in complete graphs