On claws belonging to every tournament


A directed graph is said to ben-unavoidable if it is contained as a subgraph by every tournament onn vertices. A number of theorems have been proven showing that certain graphs aren-unavoidable, the first being Rédei's results that every tournament has a Hamiltonian path. M. Saks and V. Sós gave more examples in [6] and also a conjecture that states: Every directed claw onn vertices such that the outdegree of the root is at most [n/2] isn-unavoidable. Here a claw is a rooted tree obtained by identifying the roots of a set of directed paths. We give a counterexample to this conjecture and prove the following result:any claw of rootdegree≤n/4 is n-unavoidable.

This is a preview of subscription content, access via your institution.


  1. [1]

    B. Alspach, andM. Rosenfeld: Realization of certain generalized path in tournaments.Disc. Math. 34 (1981), 199–202.

    Google Scholar 

  2. [2]

    P. Erdős, andJ. W. Moon: On the sets of consistent arcs in tournaments.Canadian Math Bull.,8 (1965), 269–271.

    Google Scholar 

  3. [3]

    B. Grunbaum: Antidirected Hamiltonian paths in tournaments.J. Combinatorial Theory (B),11 (1971), 249–257.

    Google Scholar 

  4. [4]

    N. Linial, M. Saks, andV. Sós: Largest digraphs contained in alln-tournaments,Combinatorica,8 (1983), 102–104.

    Google Scholar 

  5. [5]

    M. Rosenfeld: Antidirected Hamiltonian circuits in tournament,J. Combinatorial Theory (B),16 (1974), 234–242.

    Google Scholar 

  6. [6]

    M. Saks, andV. Sós: On unavoldable subgraphs of tournaments.Colloquia Mathematica Societatis János Bolyai 37, Finite and infinite Sets, Eger (Hungary), 1981. 663–674.

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Lu, X. On claws belonging to every tournament. Combinatorica 11, 173–179 (1991). https://doi.org/10.1007/BF01206360

Download citation

AMS subject classification code (1980)

  • 05 C 20