INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS

DOI10.1142/S0218216508006014MaRDI QIDQ3519627zbMATH OpenFDO

Authors Danielle O'Donnol

Publication date 19 August 2008

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

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

zbMATH Keywords

bipartite graphsembedded graphsintrinsic linkingspatial graphs

Mathematics Subject Classification ID

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

Abstract: We prove that every embedding of $K_{2n+1,2n+1}$ into $R^3$ contains a non-split link of $n$-components. Further, given an embedding of $K_{2n+1,2n+1}$ in $R^3$, every edge of $K_{2n+1,2n+1}$ is contained in a non-split $n$-component link in $K_{2n+1,2n+1}$.

Recommendations

• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• Intrinsic knotting and linking of complete graphs
• Intrinsically n-linked complete graphs
• INTRINSICALLY n-LINKED GRAPHS
• Intrinsically linked graphs with knotted components

Cites work

• INTRINSICALLY n-LINKED GRAPHS
• Intrinsically triple linked complete graphs
• Knots and links in spatial graphs
• Sachs' linkless embedding conjecture
• SOME NEW INTRINSICALLY 3-LINKED GRAPHS

Cited in

(9)

• The extremal function for bipartite linklessly embeddable graphs
• Intrinsically linked graphs in projective space
• Counting links and knots in complete graphs
• Intrinsically linked graphs with knotted components
• The boundaries of dipole graphs and the complete bipartite graphs \(K_{2,n}\)
• INTRINSICALLY n-LINKED GRAPHS
• Plane curves in an immersed graph in \({\mathbb R}^{2}\)
• EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K_2,n
• Intrinsically n-linked complete graphs

This page was built for publication: INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS

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