Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs
Abstract A digraph is ‐ dominating if every set of at most vertices has a common out‐neighbor. For all integers , let be the smallest integer such that the vertices of every 2‐edge‐colored (finite or infinite) complete digraph (including loops) can be covered by the vertices of at most monochromatic …