On the number of links in a linearly embedded K3,3,1

DOI10.1142/S0218216515500418MaRDI QIDQ2947790zbMATH OpenOpenAlexFDO

Authors Ramin Naimi, Elena Pavelescu

Publication date 29 September 2015

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

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

zbMATH Keywords

intrinsically linkedlinear embeddingspatial graphstraight-edge embedding, \(K_{3,3,1}\)

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.

Cites work

• KNOTS AND LINKS IN LINEAR EMBEDDINGS OF K₆
• Knots and links in spatial graphs
• KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K₇ INTO ℝ³
• Realization of knots and links in a spatial graph
• Sachs' linkless embedding conjecture
• Spatial graphs and oriented matroids: The trefoil

Cited in

(5)

• Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs
• An infinite family of linklessly embeddable Tutte-4-connected graphs
• Linking number and writhe in random linear embeddings of graphs
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• Recent developments in spatial graph theory

This page was built for publication: On the number of links in a linearly embedded K_3,3,1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947790)