1 paper
Dóra Erdős, András Frank, Krisztián Kun
We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum cardinality of the union of k sink-stable sets. The results imply a recent min-…