Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph

TL;DR

This paper proves that removing an edge from a 3-cycle in an intrinsically knotted graph results in an intrinsically linked graph, establishing a new relationship between these two topological graph properties.

Contribution

It introduces a novel result linking intrinsic knotting and linking through edge deletion in 3-cycles.

Findings

Removing an edge from a 3-cycle in an intrinsically knotted graph yields an intrinsically linked graph.

Establishes a direct connection between knotting and linking properties in graphs.

Provides a new method to analyze topological graph properties.

Abstract

We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.