0000000001175316

AUTHOR

Xiaoyun Lu

showing 1 related works from this author

Claws contained in all n-tournaments

1993

Abstract We prove that any claw of order n with degree d≤ 3 8 n 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.

Discrete mathematicsComputer Science::Computer Science and Game TheoryClawMathematics::CombinatoricsComputer Science::Neural and Evolutionary ComputationHamiltonian pathTheoretical Computer ScienceCombinatoricssymbols.namesakeCorollaryComputer Science::Discrete MathematicssymbolsDiscrete Mathematics and CombinatoricsTournamentMathematicsDiscrete Mathematics
researchProduct