Skip to main content
Springer Nature Link
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

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Novi Sad, Trg D.Obradovica 4, 21000 Novi Sad, Yugoslavia. e-mail: vojpet@im.ns.ac.yu, , , , , , YU

    Vojislav Petrovic & Miroslav Treml

Authors
  1. Vojislav Petrovic
    View author publications

    Search author on:PubMed Google Scholar

  2. Miroslav Treml
    View author publications

    Search author on:PubMed Google Scholar

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