Maximal knotless graphs

Lindsay Eakins, Thomas Fleming, Thomas W. Mattman

A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\frac{7}{4}|V|$ edges, and construct an infi…