Skip to main content
Log in

Claws in Rotational Tournaments

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

A claw is a rooted tree whose each branch is a directed path starting at the root. We prove that each rotational tournament on 2n+1 vertices contains all claws with 2n edges and at most n branches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 15, 1999 Final version received: April 18, 2001

Acknowledgements. The authors wish to express their gratitude to the referee for valuable remarks, suggestions and comments that led to an improved paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Petrovic, V., Treml, M. Claws in Rotational Tournaments. Graphs Comb 18, 591–596 (2002). https://doi.org/10.1007/s003730200043

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200043

Keywords

Navigation