Kernels in quasi-transitive digraphs (Q2501570)

In this paper \(D\) denotes a possibly infinite digraph. A kernel \(N\) of a digraph \(D\) is an independent set of vertices such that for each \(w\in V(D)-N\) there exists an arc from \(w\) to \(N\). A digraph \(D\) is quasi-transitive when \(uv\in A(D)\) and \(vw\in A(D)\) implies that \(uw\in A(D)\) or \(wu\in A(D)\). The main result of this paper says: Let \(D\) be a digraph such that \(D=D_1\cup D_2\) (possibly \(A(D_1)\cap A(D_2)\neq\emptyset\)), where \(D_i\) is a quasi-transitive digraph which contains no asymmetrical infinite outward path for \(i=1,2\). If every directed cycle of length 3 in \(D\) has at least two symmetrical arcs, then \(D\) has a kernel.