Quasi-kernels and quasi-sinks in infinite graphs

Peter L. Erdos, Lajos Soukup

Given a directed graph G=(V,E) an independent set A of the vertices V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point o…