Distant digraph domination

Tung Nguyen, Alex Scott, Paul Seymour

A {\em $k$-kernel} in a digraph $G$ is a stable set $X$ of vertices such that every vertex of $G$ can be joined from $X$ by a directed path of length at most $k$. We prove three re…