A kernel of a digraph is an independent set $K$ such that every vertex outside $K$ has an arc to a vertex in $K$. We present a polyhedral description of kernels in clique-acyclic orientations of line multigraphs. Given a digraph $D$, let $FK(D)$ denote its fractional kernel polytope, and let $σ(D)$ denote the linear system defining $FK(D)$. A digraph $D$ is called kernel perfect if every induced subdigraph has a kernel, called kernel ideal if the fractional kernel polytope of every induced subdigraph is integral, and called kernel Mengerian if the defining system of every induced subdigraph is totally dual integral. We show that a clique-acyclic orientation of a line multigraph is kernel ideal if and only if it is kernel Mengerian. These equivalent properties hold precisely when the orientation is kernel perfect and has no even-cycle obstruction.

翻译：暂无翻译