Four triangle-free intrinsically knotted graphs with 22 edges
An intrinsically knotted graph is one for which every spatial embedding contains a nontrivially knotted cycle. Classifying such graphs is a central problem in spatial graph theory. It is known that every intrinsically knotted graph has at least 21 edges, and the case of 21 edges has been completely resolved. For 22 edg...