Abstract
In 1983 Conway and Gordon proved that for every 3D embedding of the complete graph on seven points at least one of the 7cycles would be knotted The graph is thus called an intrinsically knotted graph Similarly the graph is intrinsically linked because it will always contain two linked 3cycles
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
