Oriented star packings

Given a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a collection of vertex disjoint subgraphs of D, each isomorphic to a member of S. The S-PACKING problem asks for the maximum number of vertices, of a host digraph D, that can be covered by an S-packing of D. We prove a dichotomy for the decision version of the S-packing… CONTINUE READING