Claws in Rotational Tournaments

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

Saved in:
Bibliographic Details
Published in:Graphs and combinatorics 2002-10, Vol.18 (3), p.591-596
Main Authors: Petrovic, Vojislav, Treml, Miroslav
Format: Article
Language:English
Subjects:
Combinatorics
Mathematical analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A claw is a rooted tree whose each branch is a directed path starting at the root. We prove that each rotational tournament on 2 n +1 vertices contains all claws with 2 n edges and at most n branches. [PUBLICATION ABSTRACT]
ISSN:0911-0119
1435-5914
DOI:10.1007/s003730200043