Abstract
Robertson, Seymour, and Thomas characterized linkless embeddings of graphs by flat embeddings, and determined the obstruction set for linkless embeddings. In this paper, we extend flat embeddings to "primitive embeddings" as linkless embeddings to knotless embeddings. Although the obstruction set for knotless embeddings has not been determined, fundamental theorems and conjectures are obtained.
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.
