1 paper
Danielle Gregg, Thomas W. Mattman, Zachary Porat +1
The obstruction set for graphs with knotless embeddings is not known, but a recent paper of Goldberg, Mattman, and Naimi indicates that it is quite large. Almost all known obstruct…