Directed graphs can be intrinsically knotted and 4-linked.
problem Intrinsic linking and knotting in directed graphs.
method Construction of examples and operations (consistent edge contraction, H-cyclic subcontraction).
result Directed graphs can have consistently oriented knotted cycles and intrinsically 3- and 4-linked structures.