CLAWS CONTAINED IN ALL N-TOURNAMENTS

Authors
LU XY
Citation
Xy. Lu, CLAWS CONTAINED IN ALL N-TOURNAMENTS, Discrete mathematics, 119(1-3), 1993, pp. 107-111
Citations number
7
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Discrete mathematics → ACNP
ISSN journal
0012365X
Volume
119
Issue
1-3
Year of publication
1993
Pages
107 - 111
Database
ISI
SICI code
0012-365X(1993)119:1-3<107:CCIAN>2.0.ZU;2-T
Abstract
We prove that any claw of order n with degree d less-than-or-equal-to 3/8n is n-unavoidable, which means that any tournament of order n cont ains it as a subdigraph. A simple corollary is that any tournament has a directed Hamiltonian path.