Digraphs modulo primitive positive constructability
arXiv:2402.16729
Abstract
This is my dissertation about digraphs ordered by pp-constructability. We study in particular smooth digraphs, i.e., digraphs without sources or sinks, tournaments and semicomplete digraphs, orientations of paths and cycles, digraphs with at most four vertices, and orientations of trees.
Added a new (now correct) proof of Lemma 2.81