Convex sets in acyclic digraphs

P. Balister, S. Gerke, G. Gutin

A non-empty set $X$ of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by $X$ is connected and it is called convex if no two vertices…