Star-factors of tournaments

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
5 pages, 1 figure

Keywords

Combinatorics, 05C20, 05C35, 05C70

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/77121

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9807021
 http://arxiv.org/abs/math/9807021
 J. Graph Theory 28 (1998), 141-145.

Collections

arXiv