Kernels in pretransitive digraphs. (Q1420591): Difference between revisions

The authors continue in the study of kernels of a possibly infinite digraph. They use the notions of an infinite outward path, a right-pretransitive and a left-pretransitive digraph. A digraph \(D\) is kernel-perfect when every induced subgraph of \(D\) has a kernel. They prove the following result: Let \(D\) be a digraph. If \(D=D_1\cup D_2\), where \(D_1\) is a right-pretransitive digraph, \(D_2\) is a left-pretransitive digraph and \(D_i\) contains no infinite outward path for \(i\in \{1,2\}\), then \(D\) is a kernel-perfect digraph. Moreover, the authors give some examples concerning the assumptions in this result.