Star-factors of tournaments
组合数学
2007-05-23 v1
摘要
Let S_m 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 S_m. We prove that m lg m - m lg lg m <= f(m) <= 4m^2 - 6m for sufficiently large m.
引用
@article{arxiv.math/9807021,
title = {Star-factors of tournaments},
author = {Guantao Chen and Xiaoyun Lu and Douglas B. West},
journal= {arXiv preprint arXiv:math/9807021},
year = {2007}
}
备注
5 pages, 1 figure