Quasi-kernels and quasi-sinks
Statement
A quasi-kernel of a digraph is an independent vertex set sucht that every vertex is reachable from in by a path of length at most two. A quasi-sink of is a quasi-kernel of the digraph that we obtain by changing the direction of the edges in . Is it true that for any infinite digraph there is a partition of such that admits a quasi-kernel and admits a quasi-sink?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.