Intrinsic 3-linkedness is Not Preserved by Y∇ moves

2014/10/08 by Danielle O’Donnol, Danielle O'Donnol, O'Donnol, Danielle
Computer Science · Mathematics · #57M25 #Advanced Graph Theory Research #Advanced Topology and Set Theory #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Primary 57M15 #Secondary 05C10 #math.GT #msc:05C10 #msc:57M15 #msc:57M25

paper · pdf · doi:10.48550/arxiv.1410.1971

11 pages, 7 figures

arxiv created 2014/10/08 · openalex publication_date 2014/10/08 · arxiv updated 2014/10/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper introduces a number of new intrinsically 3-linked graphs through five new constructions. We then prove that intrinsic 3-linkedness is not preserved by Y∇ moves. We will see that the graph M, which is obtained through a Y∇ move on (PG)^*_*(PG), is not intrinsically 3-linked.

Related

• Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
• On intrinsically knotted and linked graphs
• Some `converses' to intrinsic linking theorems
• Two Analogs of Intrinsically Linked Graphs
• Intrinsic knotting and linking of almost complete partite graphs