Abstract
An embedding $f:G \to {{\mathbf {R}}^3}$ of a graph $G$ into ${{\mathbf {R}}^3}$ is said to be linear if each edge $f(e)\quad (e \in E(G))$ is a straight line segment. It will be shown that for any knot or link type $k$, there is a finite number $R(k)$ such that every linear embedding of the complete graph ${K_n}$ with at least $R(k)$ vertices $(n \geqslant R(k))$ in ${{\mathbf {R}}^3}$ contains a knot or link equivalent to $k$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.