Star-factors of tournaments

Details Star-factors of tournaments Star-factors of tournaments

1998-07-03

arxiv.org/abs/math/9807021v1

J. Graph Theory 28 (1998), 141-145.

Mathematics

Combinatorics

5 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Star-factors of tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Star-factors of tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Star-factors of tournaments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-428746