Intrinsic linking and knotting are arbitrarily complex in directed graphs

Thomas W. Mattman, Ramin Naimi, Benjamin Pagano

Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrin…