Claws contained in all n-tournaments


Lu, X., Claws contained in all n-tournaments, Discrete Mathematics 119 (1993) 107-l 11. We prove that any claw of order n with degree d<in is n-unavoidable, which means that any tournament of order n contains it as a subdigraph. A simple corollary is that any tournament has a directed Hamiltonian path.

DOI: 10.1016/0012-365X(93)90120-I

Cite this paper

@article{Lu1993ClawsCI, title={Claws contained in all n-tournaments}, author={Xiaoyun Lu}, journal={Discrete Mathematics}, year={1993}, volume={119}, pages={107-111} }