1998/07/03 by Guantao Chen, Xiaoyun Lu, Douglas B. West
Mathematics · #math.CO #msc:05C20 #msc:05C35 #msc:05C70
published as J. Graph Theory 28 (1998), 141-145. · 5 pages, 1 figure
arxiv created 1998/07/03 · arxiv updated 2009/11/30
Let Sm denote the m-vertex simple digraph formed by m-1 edges with a common tail. Let f(m) denote the minimum n such that every n-vertex tournament has a spanning subgraph consisting of n/m disjoint copies of Sm. We prove that m lg m - m lg lg m <= f(m) <= 4m2 - 6m for sufficiently large m.