Star-factors of tournaments

Simple item page
dc.creatorChen, Guantao
dc.creatorLu, Xiaoyun
dc.creatorWest, Douglas B.
dc.date1998-07-03
dc.date.accessioned2026-07-07T05:25:17Z
dc.date.available2026-07-07T05:25:17Z
dc.descriptionLet 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.
dc.description5 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/9807021
dc.identifierhttp://arxiv.org/abs/math/9807021
dc.identifierJ. Graph Theory 28 (1998), 141-145.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77121
dc.subjectCombinatorics
dc.subject05C20, 05C35, 05C70
dc.titleStar-factors of tournaments
dc.typetext

Files

Collections

arXiv