ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A quasi-kernel of a digraph DD is an independent vertex set KK sucht that every vertex is reachable from KK in DD by a path of length at most two. A quasi-sink of DD is a quasi-kernel of the digraph that we obtain by changing the direction of the edges in DD. Is it true that for any infinite digraph D=(V,A)D=(V,A) there is a partition {V1,V2}\{V_1, V_2\} of VV such that D[V1]D[V_1] admits a quasi-kernel and D[V2]D[V_2] 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.