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.
Similar content being viewed by others
Author information
Authors and Affiliations
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
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
Issue Date:
DOI: https://doi.org/10.1007/s003730200043