Intrinsically n-linked Complete Bipartite Graphs

Simple item page
dc.creatorO'Donnol, Danielle
dc.date2005-12-09
dc.date2007-05-18
dc.date.accessioned2026-07-07T08:02:07Z
dc.date.available2026-07-07T08:02:07Z
dc.descriptionWe 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}$.
dc.description8 pages, LaTex; corrected proof and added thm and cor
dc.identifierhttps://arxiv.org/abs/math/0512205
dc.identifierhttp://arxiv.org/abs/math/0512205
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129129
dc.subjectGeometric Topology
dc.subject57M25; 05C10
dc.titleIntrinsically n-linked Complete Bipartite Graphs
dc.typetext

Files

Collections

arXiv