domination in directed graphs with transitive tournaments

38 Views Asked by At

Given a digraph on n vertices, suppose the subgraph induced by any k of its vertices contains a transitive k-vertex tournament as a subgraph. Does the digraph have a dominating set consisting of l vertices? For which smallest k, if any, is the minimum such l=l(n,k) independent of n?